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!)
A055011 a(n+1) = next smallest prime beginning with a(n) when written in binary, starting with 2. 4
2, 5, 11, 23, 47, 191, 383, 3067, 12269, 196307, 6281839, 50254717, 201018869, 804075479, 1608150959, 102921661397 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

a(5)=191 because a(4)=47 which in binary is 101111, none of 1011110(94) 1011111(95) 10111100(188) 10111101(189) 10111110 (190) are prime, but 10111111(191) is.

LINKS

Table of n, a(n) for n=0..15.

FORMULA

a(n+1) = A208241(a(n)). - Reinhard Zumkeller, Feb 14 2013

PROG

(Haskell)

a055011 n = a055011_list !! n

a055011_list = iterate a208241 2  -- Reinhard Zumkeller, Feb 14 2013

CROSSREFS

Cf. A048549 for base 10 analog.

A055011, A261200 and A261201 are all essentially the same sequence.

Sequence in context: A055496 A105120 A084403 * A261201 A007505 A246492

Adjacent sequences:  A055008 A055009 A055010 * A055012 A055013 A055014

KEYWORD

base,easy,more,nonn

AUTHOR

Henry Bottomley, May 31 2000

STATUS

approved

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 8 21:00 EST 2016. Contains 278950 sequences.