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”).

A173550
a(n) = k smallest exponent of N = 2^k of first prime(1) = 2 where string "p(1) ... p(n)" appears in the decimal representation of N (n=1,2,...).
0
1, 41, 81, 256, 2810, 19680, 131516, 1812049
OFFSET
1,2
REFERENCES
Julian Havil, Impossible?: Surprising Solutions to Counterintuitive Conundrums, Princeton University Press 2008
EXAMPLE
n=1: 2^1 = 2
n=2: 2^41 = 2199023255552, "23" appears on decimals 6-7
n=3: 2^81 = 2417851639229258349412352, "235" appears on decimals 22-24
n=4: 2^256 has 78 decimals, "2357" appears on decimals 20-23
2^256 = 115792089237316195423570985008687907853269984665640564039457584007913129639936
KEYWORD
nonn,base
AUTHOR
Eva-Maria Zschorn (e-m.zschorn(AT)zaschendorf.km3.de), Feb 21 2010
EXTENSIONS
Extended and edited by Hans Havermann, Mar 20 2010
STATUS
approved