.. |
Ahmad J. Masad
|
4d085c9032
Remove commit history
|
4 years ago |
Albert Böschow
|
61075acbf6
new file: "oeis-research/Albert B\303\266schow/Numbers k where phi(k) divides k - 3/smooth_search.pl"
|
2 years ago |
Alex Costea
|
4d085c9032
Remove commit history
|
4 years ago |
Alex Ratushnyak
|
3865ba3b60
new file: oeis-research/Amiram Eldar/Least number k such that A048105(k) = A048105(k+1) = 2*n, and 0 if it does not exist/prog.pl
|
3 years ago |
Alexander Adamchuk
|
8fc34c482e
Update.
|
2 years ago |
Alexander R. Povolotsky
|
08f403d7c3
Update.
|
1 year ago |
Altug Alkan
|
7d83987246
Update.
|
1 year ago |
Amarnath Murthy
|
d5eaac8bd7
new file: oeis-research/Amarnath Murthy/Smallest number sandwiched between two numbers having exactly n prime divisors/generate_fast.pl
|
1 year ago |
Amiram Eldar
|
5e55b458a1
new file: oeis-research/Amiram Eldar/a(n) is the minimum number of distinct numbers with exactly n prime factors (counted with multiplicity) whose sum of reciprocals exceeds 1/prog.pl
|
1 month ago |
Antti Karttunen
|
9abfce7ac0
new file: oeis-research/Antti Karttunen/Numbers k such that derivative(sigma(k)) = k/search.sf
|
3 years ago |
Arkadiusz Wesolowski
|
0aac7884c3
new file: oeis-research/Arkadiusz Wesolowski/Numbers k such that phi(binomial(k,2)) is a power of 2/prog.sf
|
3 years ago |
Arsen Vardanyan
|
c65520f481
Update.
|
1 year ago |
Artsiom Palkounikau
|
4d085c9032
Remove commit history
|
4 years ago |
Artur Jasinski
|
0c4a756092
new file: oeis-research/Artur Jasinski/a(n) = the smallest prime divisor of A138793(n)/prog.sf
|
2 years ago |
Benoit Cloitre
|
2b693fc78d
new file: oeis-research/Benoit Cloitre/Where 11^n occurs in n-almost-primes, starting at a(0)=1/prog.sf
|
1 year ago |
Bernard Schott
|
5427f05b84
Update.
|
1 year ago |
Bodo Zinser
|
4d085c9032
Remove commit history
|
4 years ago |
Brad Clardy
|
df529e2f1d
Update.
|
1 year ago |
Chai Wah Wu
|
a38dc6d971
Update.
|
1 year ago |
Charles R Greathouse IV
|
0672e812c0
2^(2^16) - 2^11267 - 1 is prime!
|
4 years ago |
Charles T. Le
|
4d085c9032
Remove commit history
|
4 years ago |
Charlie Neder
|
4d085c9032
Remove commit history
|
4 years ago |
Cino Hilliard
|
4d085c9032
Remove commit history
|
4 years ago |
Clark Kimberling
|
1af2ab854d
Update.
|
1 year ago |
Claude H. R. Dequatre
|
7fba720525
Update.
|
1 year ago |
Claudio Meller
|
4d085c9032
Remove commit history
|
4 years ago |
Colin Barker
|
8fc34c482e
Update.
|
2 years ago |
Ctibor O. Zizka
|
342d8ebfb7
new file: oeis-research/Amarnath Murthy/Sum of the remainders when n^2 is divided by squares < n/prog.sf
|
3 years ago |
César Aguilera
|
4d085c9032
Remove commit history
|
4 years ago |
Daniel Hoya
|
4d085c9032
Remove commit history
|
4 years ago |
Daniel Lignon
|
098de59794
new file: oeis-research/Daniel Lignon/Composite numbers for which the harmonic mean of proper divisors is an integer/generate_special_form.sf
|
3 years ago |
Daniel Suteu
|
e743bcaf8d
Update.
|
2 months ago |
Darío Clavijo
|
af4decfc29
Update.
|
1 year ago |
David James Sycamore
|
4d085c9032
Remove commit history
|
4 years ago |
Derek Orr
|
61449f48a1
Update.
|
1 year ago |
Donovan Johnson
|
665e7e9d26
new file: oeis-research/Donovan Johnson/Smallest number m such that sigma(m) has exactly n distinct prime factors/upper-bounds.sf
|
2 years ago |
Eder Vanzei
|
4d085c9032
Remove commit history
|
4 years ago |
Eduard Roure Perdices
|
4d085c9032
Remove commit history
|
4 years ago |
Elliott Line
|
4d085c9032
Remove commit history
|
4 years ago |
Erich Friedman
|
7ea6dd432d
new file: oeis-research/Erich Friedman/Squares that remain squares if you decrease every digit by 1/b061844.txt
|
9 months ago |
Falcon Shapiro
|
4d085c9032
Remove commit history
|
4 years ago |
Farideh Firoozbakht
|
4d085c9032
Remove commit history
|
4 years ago |
Felix Fröhlich
|
fc5a0aa028
Update.
|
9 months ago |
Fernando Solanet Mayou
|
6204d7b3f2
new file: oeis-research/Fernando Solanet Mayou/a(n) is the smallest number that is (zeroless) pandigital in all bases 2 <= k <= n/prog.pl
|
2 years ago |
G. L. Honaker, Jr.
|
4d085c9032
Remove commit history
|
4 years ago |
Gionata Neri
|
601beb2b62
new file: oeis-research/Gionata Neri/Least number k > primorial(n) such that omega(k) = n-1/prog.sf
|
1 year ago |
Giorgos Kalogeropoulos
|
b26f90f942
modified: oeis-research/Giorgos Kalogeropoulos/Least positive integer not already in the sequence with the property that the concatenation a(0)a(1)...a(n) forms an integer with n distinct prime factors/prog.sf
|
1 month ago |
Giovanni Resta
|
e6e24cbcd4
Update.
|
1 year ago |
Gonzalo Martínez
|
d91e601bd3
new file: "oeis-research/Gonzalo Mart\303\255nez/Integers k such that fib(k) + reverse(fib(k)) is prime/prog.sf"
|
4 months ago |
Greg Dresden
|
4d085c9032
Remove commit history
|
4 years ago |
Gus Wiseman
|
4d085c9032
Remove commit history
|
4 years ago |
Hans Havermann
|
147f6207b2
Update.
|
1 year ago |
Howard Berman
|
fcddb391e4
new file: oeis-research/Amiram Eldar/Numbers k such that F(k), F(k+1) and F(k+2) have the same binary weight (A000120), where F(k) is the k-th Fibonacci number (A000045)/prog.pl
|
2 years ago |
Hugo Pfoertner
|
1bb64ed8d3
Update.
|
5 months ago |
Ilya Gutkovskiy
|
e743bcaf8d
Update.
|
2 months ago |
Irina Gerasimova
|
7935360128
Update.
|
1 year ago |
Ivan N. Ianakiev
|
e38f3391fa
Update.
|
2 years ago |
J. Lowell
|
06fe1bd46c
new file: oeis-research/J. Lowell/a(1)=1; for n > 1, a(n) is the smallest number with the same number of divisors as 2*a(n-1)/prog.pl
|
2 years ago |
J. M. Bergot
|
1bb64ed8d3
Update.
|
5 months ago |
J.W.L. (Jan) Eerland
|
e743bcaf8d
Update.
|
2 months ago |
Jacques Tramu
|
986b4f84f2
Update.
|
7 months ago |
James S. DeArmon
|
78fc7c508a
Update.
|
6 months ago |
Jaroslav Krizek
|
6aed7a3c01
Update.
|
3 years ago |
Jason Earls
|
2b693fc78d
new file: oeis-research/Benoit Cloitre/Where 11^n occurs in n-almost-primes, starting at a(0)=1/prog.sf
|
1 year ago |
Jean-Marc Rebert
|
e743bcaf8d
Update.
|
2 months ago |
Jeff Burch
|
4d085c9032
Remove commit history
|
4 years ago |
Jeppe Stig Nielsen
|
147f6207b2
Update.
|
1 year ago |
Jianing Song
|
6204d7b3f2
new file: oeis-research/Fernando Solanet Mayou/a(n) is the smallest number that is (zeroless) pandigital in all bases 2 <= k <= n/prog.pl
|
2 years ago |
Jinyuan Wang
|
416c61a8d4
new file: oeis-research/Ilya Gutkovskiy/Maximal coefficient of (1 + x^a(1)) * (1 + x^a(1) + x^a(2)) * ... * (1 + x^a(1) + x^a(2) + ... + x^a(n-1))/prog.sf
|
7 months ago |
Jon E. Schoenfield
|
be5d395dcd
new file: oeis-research/Jason Earls/Largest prime factor of A019518, concatenation of first n primes/prog.sf
|
2 years ago |
Jonathan Sondow
|
8fc34c482e
Update.
|
2 years ago |
Jonathan Vos Post
|
7d83987246
Update.
|
1 year ago |
Joseph Biberstine
|
47a7397f2c
new file: oeis-research/Joseph Biberstine/Sum of remainders of the n-th prime mod k, for k = 1..n/prog.sf
|
3 years ago |
José María Grau Ribas
|
4e90aa9a0b
Update.
|
1 year ago |
Jud McCranie
|
f2bf689bee
new file: oeis-research/Amiram Eldar/Number of primitive abundant numbers (A071395) < 10^n/generate.sf
|
7 months ago |
Julien Peter Benney
|
4d085c9032
Remove commit history
|
4 years ago |
Juri-Stepan Gerasimov
|
e971514faf
Update.
|
5 months ago |
Kevin Batista
|
df529e2f1d
Update.
|
1 year ago |
Kevin P. Thompson
|
fc775e378b
Update.
|
1 year ago |
Kevin Ryde
|
53ebc848c8
new file: oeis-research/Kevin Ryde/a(1) = 1 and thereafter a(n) = 2*prime(a(n-1))/prog.sf
|
2 years ago |
Klaus Brockhaus
|
e28dfa2b81
new file: oeis-research/J. M. Bergot/Smallest prime p such that p-1 and p+1 both have n prime factors (with multiplicity)/generate.pl
|
1 year ago |
Labos Elemer
|
fc5a0aa028
Update.
|
9 months ago |
Lekraj Beedassy
|
9303a08f23
Update.
|
1 year ago |
Leroy Quet
|
098de59794
new file: oeis-research/Daniel Lignon/Composite numbers for which the harmonic mean of proper divisors is an integer/generate_special_form.sf
|
3 years ago |
Lorenzo Sauras Altuzarra
|
4d085c9032
Remove commit history
|
4 years ago |
Luis H. Gallardo
|
fcddb391e4
new file: oeis-research/Amiram Eldar/Numbers k such that F(k), F(k+1) and F(k+2) have the same binary weight (A000120), where F(k) is the k-th Fibonacci number (A000045)/prog.pl
|
2 years ago |
M. F. Hasler
|
64979be6a4
new file: oeis-research/J.W.L. (Jan) Eerland/Least prime p such that p^n + 6 is the product of n distinct primes/is_squarefree_almost_prime.sf
|
7 months ago |
M. Farrokhi D. G.
|
e2569b03ac
Added several more scripts.
|
9 months ago |
Maheswara Rao Valluri
|
4d085c9032
Remove commit history
|
4 years ago |
Manuel Valdivia
|
4d085c9032
Remove commit history
|
4 years ago |
Marco Ripà
|
57ec8c5a4b
new file: oeis-research/Daniel Suteu/Smallest number k > 0 such that bigomega(k^n + 1) = n/prog.sf
|
9 months ago |
Marius A. Burtea
|
53ebc848c8
new file: oeis-research/Kevin Ryde/a(1) = 1 and thereafter a(n) = 2*prime(a(n-1))/prog.sf
|
2 years ago |
Matthew Campbell
|
87de3b82b9
new file: oeis-research/Amiram Eldar/Odd numbers that are not safe primes such that p-1 | k-1 or k-1 | p-1 for every prime p | 2^(k-1)-1/prog.sf
|
3 years ago |
Max Alekseyev
|
147f6207b2
Update.
|
1 year ago |
Max Z. Scialabba
|
7ea6dd432d
new file: oeis-research/Erich Friedman/Squares that remain squares if you decrease every digit by 1/b061844.txt
|
9 months ago |
Metin Sariyar
|
bdfb549653
new file: oeis-research/Metin Sariyar/Numbers m such that Sum_{k=1..m} omega(k) = sigma(m)/inverse_sigma_smooth_search.pl
|
3 years ago |
Michael S. Branicky
|
fc775e378b
Update.
|
1 year ago |
Michel Lagneau
|
1bb64ed8d3
Update.
|
5 months ago |
Michel Marcus
|
5427f05b84
Update.
|
1 year ago |
Mohammed Bouayoun
|
e38f3391fa
Update.
|
2 years ago |
Muniru A Asiru
|
4d085c9032
Remove commit history
|
4 years ago |
N. J. A. Sloane
|
147f6207b2
Update.
|
1 year ago |
Naohiro Nomoto
|
085080796b
new file: oeis-research/Ilya Gutkovskiy/N-th prime recursive sum/prog.sf
|
3 years ago |
Nicolas Bělohoubek
|
532ff31203
Update.
|
2 years ago |
Oliver Townsend
|
c65520f481
Update.
|
1 year ago |
Olivier Gérard
|
4d085c9032
Remove commit history
|
4 years ago |
Omar E. Pol
|
4d085c9032
Remove commit history
|
4 years ago |
Ovidiu Bagdasar
|
4d085c9032
Remove commit history
|
4 years ago |
Paolo Galliani
|
4d085c9032
Remove commit history
|
4 years ago |
Paolo P. Lava
|
57ec8c5a4b
new file: oeis-research/Daniel Suteu/Smallest number k > 0 such that bigomega(k^n + 1) = n/prog.sf
|
9 months ago |
Paolo Xausa
|
44b74a4e08
new file: factorization-reports/abundant_carmichael+1_factor.txt
|
3 years ago |
Patrick De Geest
|
147f6207b2
Update.
|
1 year ago |
Paul Vanderveen
|
d5b49d04aa
modified: oeis-research/Paul Vanderveen/Smallest prime p == 3 (mod 4) such that all of 2,3,5,...,prime(n) are primitive roots mod p/search.pl
|
2 years ago |
Peter Kagey
|
4d085c9032
Remove commit history
|
4 years ago |
Peter Luschny
|
4d085c9032
Remove commit history
|
4 years ago |
Petros Hadjicostas
|
4d085c9032
Remove commit history
|
4 years ago |
Philip Mizzi
|
4d085c9032
Remove commit history
|
4 years ago |
Pierre CAMI
|
75ecb5b718
new file: oeis-research/Pierre CAMI/Least k such that k * M(n) * M(n+1) + 1 is prime where M(n) = A000668(n)/prog.sf
|
8 months ago |
Pontus von Brömssen
|
5427f05b84
Update.
|
1 year ago |
Ralf Stephan
|
4d085c9032
Remove commit history
|
4 years ago |
Reinhard Zumkeller
|
e6e24cbcd4
Update.
|
1 year ago |
Richard N. Smith
|
4d085c9032
Remove commit history
|
4 years ago |
Richard Pinch
|
df529e2f1d
Update.
|
1 year ago |
Rick L. Shepherd
|
00d3898010
Update.
|
1 year ago |
Robert FERREOL
|
d91e601bd3
new file: "oeis-research/Gonzalo Mart\303\255nez/Integers k such that fib(k) + reverse(fib(k)) is prime/prog.sf"
|
4 months ago |
Robert G. Wilson v
|
5e55b458a1
new file: oeis-research/Amiram Eldar/a(n) is the minimum number of distinct numbers with exactly n prime factors (counted with multiplicity) whose sum of reciprocals exceeds 1/prog.pl
|
1 month ago |
Robert Israel
|
ee26f2f69e
new file: oeis-research/Robert Israel/Least k for which A237196(k) = n/prog.pl
|
4 months ago |
Robert Price
|
5e55b458a1
new file: oeis-research/Amiram Eldar/a(n) is the minimum number of distinct numbers with exactly n prime factors (counted with multiplicity) whose sum of reciprocals exceeds 1/prog.pl
|
1 month ago |
Ryan Propper
|
182a35d6ab
Update.
|
1 year ago |
Rémy Sigrist
|
34bbd45cb3
Recompress images.
|
1 year ago |
Scott R. Shannon
|
ee26f2f69e
new file: oeis-research/Robert Israel/Least k for which A237196(k) = n/prog.pl
|
4 months ago |
Seiichi Manyama
|
5283a1684c
Update.
|
2 years ago |
Sergio Pimentel
|
4d085c9032
Remove commit history
|
4 years ago |
Sezai Ata
|
4d085c9032
Remove commit history
|
4 years ago |
Shyam Sunder Gupta
|
fc5a0aa028
Update.
|
9 months ago |
Sidney Cadot
|
7fba720525
Update.
|
1 year ago |
Sofia Lacerda
|
3865ba3b60
new file: oeis-research/Amiram Eldar/Least number k such that A048105(k) = A048105(k+1) = 2*n, and 0 if it does not exist/prog.pl
|
3 years ago |
Stefano Spezia
|
e25af477b0
new file: oeis-research/Derek Orr/Least prime p such that p^n and p^n+1 have the same number of prime factors (counted with multiplicity) or 0 if no such number exists/simple_prog.sf
|
2 years ago |
T. D. Noe
|
0521ef8921
new file: oeis-research/T. D. Noe/Smallest odd primitive abundant number having n distinct prime factors/generate.pl
|
7 months ago |
Tejo Vrush
|
880e2a7d59
new file: oeis-research/Tejo Vrush/a(n) is the least k such that A348172(k) = n or 0 if no such k exists/smooth_generate_quotient.pl
|
2 years ago |
Thomas Gajdek
|
4d085c9032
Remove commit history
|
4 years ago |
Thomas Ordowski
|
986b4f84f2
Update.
|
7 months ago |
Tim Johannes Ohrtmann
|
fc5a0aa028
Update.
|
9 months ago |
Tomohiro Yamada
|
d2ec5f5ea3
Update.
|
3 years ago |
Tony Davie
|
4d085c9032
Remove commit history
|
4 years ago |
Torbjorn Alm
|
ad2c9fa5b1
Update.
|
2 years ago |
Vincenzo Librandi
|
182a35d6ab
Update.
|
1 year ago |
Vladimir Letsko
|
4d085c9032
Remove commit history
|
4 years ago |
Vladimir Shevelev
|
6204d7b3f2
new file: oeis-research/Fernando Solanet Mayou/a(n) is the smallest number that is (zeroless) pandigital in all bases 2 <= k <= n/prog.pl
|
2 years ago |
Wesley Ivan Hurt
|
532ff31203
Update.
|
2 years ago |
Ya-Ping Lu
|
4c6de3b172
new file: pseudoprimes/oeis-pseudoprimes/fermat_with_small_znorder.txt
|
2 years ago |
Yasutoshi Kohmoto
|
5283a1684c
Update.
|
2 years ago |
Yusuf Gurtas
|
e0999e9865
new file: oeis-research/Yusuf Gurtas/Smallest prime p for which the absolute value of the difference between the numbers of distinct prime factors of p+1 and p-1 is exactly n/upper-bounds.sf
|
2 years ago |
Zak Seidov
|
5e55b458a1
new file: oeis-research/Amiram Eldar/a(n) is the minimum number of distinct numbers with exactly n prime factors (counted with multiplicity) whose sum of reciprocals exceeds 1/prog.pl
|
1 month ago |
Zhao Hui Du
|
4d085c9032
Remove commit history
|
4 years ago |