login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A356833
Primes p such that the minimum number of divisors among the numbers between p and NextPrime(p) is a square.
3
5, 13, 19, 31, 37, 43, 53, 61, 67, 73, 79, 83, 89, 103, 109, 127, 131, 139, 151, 157, 163, 173, 181, 193, 199, 211, 223, 233, 241, 251, 257, 263, 269, 271, 277, 293, 307, 311, 313, 317, 331, 337, 353, 367, 373, 379, 383, 389, 397, 401, 409, 421, 433, 443, 449, 457, 461, 463, 467, 479
OFFSET
1,1
EXAMPLE
13 is a term because up to the next prime 17, tau(14) = 4, tau(15) = 4, tau(16) = 5, thus the smallest tau(k) is 4 and 4 is a square (2^2).
23 is prime but not a term because up to the next prime 29, tau(24) = 8, tau(25) = 3, tau(26) = 4, tau(27) = 4, tau(28) = 6, thus the smallest tau(k) = 3 and 3 is not a square.
PROG
(PARI) isok(p)=issquare(vecmin(apply(numdiv, [p+1..nextprime(p+1)-1])));
forprime(p=3, 2000, if(isok(p), print1(p", ")))
KEYWORD
nonn,easy
AUTHOR
STATUS
approved