A360623 Largest k such that the decimal representation of 2^k is missing any n-digit string.

168, 3499, 53992, 653060

Offset

1,1

Comments

All terms are conjectural, checked up to 10^6.

Links

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

Hans Havermann, Small-string final non-appearance coincidences in base-ten powers of two

Example

168 is the largest base-ten power of 2 that is missing any of the 10 length-1 digit-strings (missing '2').
3499 is the largest base-ten power of 2 that is missing any of the 100 length-2 digit-strings (missing '95').
53992 is the largest base-ten power of 2 that is missing any of the 1000 length-3 digit-strings (missing '661').
653060 is the largest base-ten power of 2 that is missing any of the 10000 length-4 digit-strings (missing '6164').

Crossrefs

Cf. A094776, A360656.

Sequence in context: A234815 A232274 A110075 * A331908 A231995 A223243

Adjacent sequences: A360620 A360621 A360622 * A360624 A360625 A360626

Keyword

nonn,base,more

Author

Hans Havermann, Feb 14 2023

Status

approved