login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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)=A00005(n). 0

%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)=A00005(n).

%Y Cf. A049591.

%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.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 5 16:08 EST 2016. Contains 278770 sequences.