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”).
%I #28 Apr 10 2024 09:18:16
%S 220,222,529,624,648,702,714,844,846,850,859,924,925,929,931,979,981,
%T 983,1062,1088,1133,1135,1219,1230,1241,1259,1310,1343,1349,1384,1394,
%U 1467,1472,1495,1503,1524,1550,1589,1627,1631,1642,1652,1656,1663,1679,1744,1751
%N Exponents k > 0 of powers of 2 such that the decimal expansion of 2^k contains more than one nonoverlapping 666 substring.
%C A positive power of 2 containing 666 in its decimal expansion is called an apocalyptic number.
%C See A371808 for a variant where overlapping substrings are counted as distinct.
%H Paolo Xausa, <a href="/A371806/b371806.txt">Table of n, a(n) for n = 1..10000</a>
%H Brady Haran and Tony Padilla, <a href="https://www.youtube.com/watch?v=0LkBwCSMsX4">Apocalyptic Numbers</a>, YouTube Numberphile video, 2024.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ApocalypticNumber.html">Apocalyptic Number</a>.
%e 220 is a term because 2^220 contains more than one nonoverlapping 666 substring in its decimal expansion:
%e 2^220 = 168499(666)66969149871(666)88442938726917102321526408785780068975640576.
%t Select[Range[2000], StringCount[IntegerString[2^#], "666"] > 1 &]
%o (Python)
%o def ok(n): return str(1<<n).count("666") > 1
%o print([k for k in range(2000) if ok(k)]) # _Michael S. Branicky_, Apr 07 2024
%Y Subsequence of A007356 and of A371808.
%Y Cf. A371807.
%K nonn,easy,base
%O 1,1
%A _Paolo Xausa_, Apr 06 2024