| .. |
|
6^n is the sum of two consecutive primes
|
4d085c9032
Remove commit history
|
4 lat temu |
|
Concatenation of numbers from n to a(n) is prime
|
4d085c9032
Remove commit history
|
4 lat temu |
|
First n-almost prime after 3^n
|
5427f05b84
Update.
|
1 rok temu |
|
First number k such that Omega(k) = n and Omega(n - 1) = Omega(n + 1) = n + 1
|
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
|
8 miesięcy temu |
|
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
|
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
|
8 miesięcy temu |
|
Least k that starts a sequence of exactly n numbers on which i + Omega(i) is constant
|
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
|
8 miesięcy temu |
|
Least number k such that 3^k-2 and 3^k+2 are the product of n prime factors counted with multiplicity
|
9303a08f23
Update.
|
1 rok temu |
|
Least odd number k such that Omega(k) = n, Omega(k+2) = n+1, and Omega(k+4) = n+2
|
7f20b33810
new file: oeis-research/Zak Seidov/Least odd number k such that Omega(k) = n, Omega(k+2) = n+1, and Omega(k+4) = n+2/prog.pl
|
3 lat temu |
|
Least prime p such that the concatenation p|n has exactly n prime factors with multiplicity
|
147f6207b2
Update.
|
1 rok temu |
|
Numbers k that are the sum and product of 5 consecutive primes
|
4d085c9032
Remove commit history
|
4 lat temu |
|
Prev prime and next prime same nr of factors
|
4d085c9032
Remove commit history
|
4 lat temu |
|
Primes p congruent to 1..10 mod 11
|
10f6e6bba5
modified: oeis-research/Zak Seidov/Primes p congruent to 1..10 mod 11/check.sf
|
3 lat temu |
|
Primes p congruent to 1..8 mod 13
|
0aff21f2d9
new file: oeis-research/Bernard Schott/Smallest number m such that tau(k) * k = m has n solutions/smooth_generate.pl
|
3 lat temu |
|
Smallest prime p cogruent to 1..prime(n)-1 mod prime(n)
|
fc7edadda6
new file: oeis-research/Zak Seidov/Primes p congruent to 1..8 mod 13/check.sf
|
3 lat temu |
|
a(n) = sigma_2(a(n-1)), with a(1) = 2
|
4d085c9032
Remove commit history
|
4 lat temu |
|
a(n) is the least k > a(n-1) such that k - a(i) for i = 0 .. n-1 all have exactly n prime factors, counted with multiplicity; a(0) = 0
|
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 miesiąc temu |
|
a(n) is the least odd number k such that Omega(k) = n, Omega(k+2) = n+1, and Omega(k+4) = n+2
|
e6e24cbcd4
Update.
|
1 rok temu |
|
a(n) is the smallest even number k such that k-1 and k+1 are both n-almost primes
|
2b693fc78d
new file: oeis-research/Benoit Cloitre/Where 11^n occurs in n-almost-primes, starting at a(0)=1/prog.sf
|
1 rok temu |
|
a(n) is the smallest number m such that m, m+1, m+2 and m+3 each have exactly n prime factors (counted with multiplicity)
|
375c48c0ee
Update.
|
2 lat temu |
