login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079246 "Memory" of 2^n: the number of (previous) powers of 2 contained as substrings in 2^n. 0
0, 0, 0, 0, 1, 1, 2, 1, 1, 2, 3, 1, 2, 3, 3, 0, 1, 2, 3, 2, 1, 1, 1, 2, 3, 3, 3, 3, 2, 3, 4, 2, 3, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 4, 4, 3, 4, 3, 2, 3, 3, 2, 2, 2, 2, 2, 3, 3, 4, 3, 3, 4, 3, 3, 4, 4, 4, 3, 2, 4, 4, 4, 3, 2, 3, 4, 4, 2, 3, 3, 4, 5, 3, 4, 3, 4, 3, 3, 4, 3, 3, 4, 3, 3, 5, 5, 4, 4, 4, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,7
LINKS
MATHEMATICA
lb = 1; ub = 100; tt = Table[ToString[2^i], {i, 1, ub}]; a = {}; For[i = lb, i <= ub, i++, m = 0; For[j = 1, j < i, j++, If[Length[StringPosition[tt[[i]], tt[[j]]]] > 0, m = m + 1]]; a = Append[a, m]]; a
CROSSREFS
Sequence in context: A351469 A286334 A118492 * A309014 A070990 A097868
KEYWORD
base,easy,nonn
AUTHOR
Joseph L. Pe, Feb 03 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)