%I M5405 #31 Apr 08 2024 09:19:14
%S 157,192,218,220,222,224,226,243,245,247,251,278,285,286,287,312,355,
%T 361,366,382,384,390,394,411,434,443,478,497,499,506,508,528,529,539,
%U 540,541,564,578,580,582,583,610,612,614,620,624,635,646,647,648,649,650
%N Apocalyptic powers: 2^a(n) contains 666.
%C Conjecture: for n > 26069, a(n) = n + 3715. [_Charles R Greathouse IV_, Sep 28 2011]
%D C. Pickover, Mazes for the Mind, St. Martin's Press, NY, 1992, p. 337.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H T. D. Noe, <a href="/A007356/b007356.txt">Table of n, a(n) for n = 1..1000</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 a(1) = 157 is a term since 2^a(1) = 2^157 = 182687704666362864775460604089535377456991567872 contains 666.
%p q:= n-> searchtext("666", cat(2^n))>0:
%p select(q, [$1..1000])[]; # _Alois P. Heinz_, Oct 26 2019
%t Select[Range[650],SequenceCount[IntegerDigits[2^#],{6,6,6}]>0&] (* _Harvey P. Dale_, Apr 10 2022 *)
%o (Python)
%o A007356_list = [k for k in range(1000) if '666' in str(2**k)] # _Chai Wah Wu_, Oct 26 2019
%K base,nonn
%O 1,1
%A _N. J. A. Sloane_, _Simon Plouffe_