A069233 Numbers n such that there is exactly 1 prime p satisfying the inequality n < p < n + tau(n)^2 where tau(n) = A000005(n).

3, 5, 11, 17, 29, 41, 49, 59, 71, 101, 107, 111, 115, 121, 137, 149, 169, 179, 191, 197, 201, 202, 203, 205, 206, 227, 239, 269, 281, 287, 289, 291, 295, 311, 314, 319, 321, 347, 361, 403, 419, 431, 461, 469, 471, 505, 521, 526, 527, 569, 599, 617, 622, 623

Offset

1,1

Links

Table of n, a(n) for n=1..54.

Prog

(PARI) isok(n) = #select(x->isprime(x), vector(numdiv(n)^2-1, k, k+n)) == 1; \\ Michel Marcus, Jun 18 2017

Crossrefs

Cf. A000005, A049591, A069230, A069231, A069232.

Sequence in context: A123533 A144105 A141262 * A329946 A063700 A078859

Adjacent sequences: A069230 A069231 A069232 * A069234 A069235 A069236

Keyword

easy,nonn

Author

Benoit Cloitre, Apr 13 2002

Status

approved