A079246 "Memory" of 2^n: the number of (previous) powers of 2 contained as substrings in 2^n.

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

Offset

1,7

Links

Table of n, a(n) for n=1..100.

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

Adjacent sequences: A079243 A079244 A079245 * A079247 A079248 A079249

Keyword

base,easy,nonn

Author

Joseph L. Pe, Feb 03 2003

Status

approved