The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A046297 Numbers k such that 2^k contains 2^11=2048 as its largest proper substring of the form 2^m. 0
 103, 267, 279, 287, 404, 503, 511, 515, 657, 685, 745, 763, 883, 890, 922, 946, 973, 991, 1011, 1087, 1114, 1121, 1164, 1197, 1209, 1272, 1274, 1283, 1302, 1316, 1328, 1360, 1378, 1432, 1445, 1478, 1509, 1511, 1542, 1565, 1571, 1584, 1627, 1672, 1678 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE 2^103 = 10141{2048}01825835211973625643008. MATHEMATICA sub2[n_] := Block[{s = ToString[2^n], k = n-1}, While[k >= 0 && ! StringContainsQ[ s, ToString[2^k]], k--]; k]; Select[Range[1000], sub2[#] == 11 &] (* Giovanni Resta, Oct 14 2019 *) CROSSREFS Cf. A033921. Sequence in context: A134214 A200732 A033204 * A252261 A141992 A023327 Adjacent sequences:  A046294 A046295 A046296 * A046298 A046299 A046300 KEYWORD nonn,base AUTHOR Patrick De Geest, Jun 15 1998 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 4 15:36 EST 2021. Contains 349526 sequences. (Running on oeis4.)