This site is supported by donations to The OEIS Foundation.

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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). 2

%I

%S 3,5,11,17,29,41,49,59,71,101,107,111,115,121,137,149,169,179,191,197,

%T 201,202,203,205,206,227,239,269,281,287,289,291,295,311,314,319,321,

%U 347,361,403,419,431,461,469,471,505,521,526,527,569,599,617,622,623

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

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

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

%K easy,nonn

%O 1,1

%A _Benoit Cloitre_, Apr 13 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.