 trizen
|
ee26f2f69e
new file: oeis-research/Robert Israel/Least k for which A237196(k) = n/prog.pl
|
3 weeks ago |
|
trizen
|
0831d580a7
new file: oeis-research/Amiram Eldar/Chernick-Carmichael number n prime factors/search for a(12)/new_sieve.jl
|
4 weeks ago |
|
trizen
|
d36f768a02
new file: oeis-research/Scott R. Shannon/Composite numbers that divide the concatenation of the reverse of their ascending order prime factors, with repetition, when written in binary/prog.pl
|
1 month ago |
|
trizen
|
d91e601bd3
new file: "oeis-research/Gonzalo Mart\303\255nez/Integers k such that fib(k) + reverse(fib(k)) is prime/prog.sf"
|
1 month ago |
|
trizen
|
eb0b6ba1f4
new file: "oeis-research/Gonzalo Mart\303\255nez/Integers k such that removing the even digits from k! yields a prime number/prog.sf"
|
1 month ago |
|
trizen
|
e971514faf
Update.
|
1 month ago |
|
trizen
|
1bb64ed8d3
Update.
|
2 months ago |
|
trizen
|
78fc7c508a
Update.
|
3 months ago |
|
trizen
|
f2bf689bee
new file: oeis-research/Amiram Eldar/Number of primitive abundant numbers (A071395) < 10^n/generate.sf
|
3 months ago |
|
trizen
|
0521ef8921
new file: oeis-research/T. D. Noe/Smallest odd primitive abundant number having n distinct prime factors/generate.pl
|
3 months ago |
|
trizen
|
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
|
3 months ago |
|
trizen
|
986b4f84f2
Update.
|
3 months ago |
|
trizen
|
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
|
3 months ago |
|
trizen
|
7cf88d901b
new file: oeis-research/Zak Seidov/First number k such that Omega(k) = n and Omega(n - 1) = Omega(n + 1) = n + 1/generate.pl
|
4 months ago |
|
trizen
|
8d20b60163
Update.
|
4 months ago |
|
trizen
|
4220419d49
new file: oeis-research/Zak Seidov/First prime p such that, if q are r are the next two primes, p + r, p + q, q + r and p + q + r all have n prime divisors, counted with multiplicity/almost_prime_generation.pl
|
5 months ago |
|
trizen
|
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
|
5 months ago |
|
trizen
|
bbbb286979
new file: python-scripts/carmichael_numbers.py
|
5 months ago |
|
trizen
|
e2569b03ac
Added several more scripts.
|
5 months ago |
|
trizen
|
7ea6dd432d
new file: oeis-research/Erich Friedman/Squares that remain squares if you decrease every digit by 1/b061844.txt
|
5 months ago |
|
trizen
|
57ec8c5a4b
new file: oeis-research/Daniel Suteu/Smallest number k > 0 such that bigomega(k^n + 1) = n/prog.sf
|
5 months ago |
|
trizen
|
8fb3377a4d
new file: 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
|
6 months ago |
|
trizen
|
fc5a0aa028
Update.
|
6 months ago |
|
trizen
|
eec403332e
new file: pseudoprimes/12-lucas-carmichael_2^64.txt
|
6 months ago |
|
trizen
|
fb63999afb
All the Lucas-Carmichael numbers up to 10^15.
|
6 months ago |
|
trizen
|
d77557bf3c
new file: oeis-research/Juri-Stepan Gerasimov/Numbers k such that k^4*2^k - 1 is a prime/prog.sf
|
6 months ago |
|
trizen
|
165a4b3824
new file: "oeis-research/Marco Rip\303\240/Initial digit of n^((n + 1)^(n + 2))/prog.sf"
|
7 months ago |
|
trizen
|
4d4e2d2d9b
Update.
|
7 months ago |
|
trizen
|
7d83987246
Update.
|
8 months ago |
|
trizen
|
601beb2b62
new file: oeis-research/Gionata Neri/Least number k > primorial(n) such that omega(k) = n-1/prog.sf
|
8 months ago |
