| .. |
|
First number that is the sum of k successive semiprimes for 1 <= k <= n
|
78fc7c508a
Update.
|
2 months ago |
|
First prime p such that p - 2 and p + 2 both have exactly n prime factors, counted with multiplicity
|
e971514faf
Update.
|
1 month ago |
|
Indices k such that A002533(k) is prime
|
0831d580a7
new file: oeis-research/Amiram Eldar/Chernick-Carmichael number n prime factors/search for a(12)/new_sieve.jl
|
2 weeks ago |
|
Least k > 1 such that all divisors of (k^n-1) over (k-1) are == 1 (mod n)
|
e348ccff91
new file: oeis-research/Amiram Eldar/Numbers k such that the arithmetic mean of the first k squarefree numbers is an integer/prog.pl
|
1 year ago |
|
Least k for which A237196(k) = n
|
ee26f2f69e
new file: oeis-research/Robert Israel/Least k for which A237196(k) = n/prog.pl
|
1 week ago |
|
Least n-gonal number that is the product of n distinct primes, or 0 if there are none
|
00d3898010
Update.
|
1 year ago |
|
Least number of the form p^2 + q^2 - 2 for primes p and q that is an odd prime times 2^n, or -1 if there is no such number
|
dbd6b43a72
Update.
|
1 year ago |
|
Least semiprime that is the first of n consecutive semiprimes s(1) ... s(n) such that s(i) - prime(i) are all equal
|
78fc7c508a
Update.
|
2 months ago |
|
Numbers k such that 10^k + 3 is a semiprime
|
e6e24cbcd4
Update.
|
8 months ago |
|
Numbers n such that binary(n) == 1 mod n
|
014d27d405
modified: oeis-research/Robert Israel/Numbers n such that binary(n) == 1 mod n/prog.c
|
3 years ago |
|
Positions of records in A306440
|
4d085c9032
Remove commit history
|
3 years ago |
|
Primes prime(k) such that prime(k)^2 + prime(k+1)^2 - 1 is the square of a prime
|
b0a884dc5a
Update.
|
1 year ago |
|
Squares in A213544
|
532ff31203
Update.
|
2 years ago |
|
a(n) is the first prime p such that, if q is the next prime, (p*q+p+q) is 5^n times a prime
|
d96b916160
Update.
|
1 year ago |
|
a(n) is the first prime that begins a sequence of exactly n consecutive primes that are emirps
|
d644c4fafe
new file: oeis-research/Robert G. Wilson v/a(n) is obtained by applying the map k -> prime(k) n times, starting at n/prog.sf
|
2 years ago |
|
a(n) is the least k such that k^j+2 is prime for j = 1 to n but not n+1
|
f89f77fa48
Update.
|
1 year ago |
|
a(n) is the least number that has exactly n divisors with sum of digits n
|
4e90aa9a0b
Update.
|
1 year ago |
