|
| |
|
|
A094776
|
|
a(n) = the greatest i such that the decimal representation of 2^i doesn't contain the digit n.
|
|
0
|
| |
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 71, p. 25, Ellipses, Paris 2008.
|
|
|
LINKS
|
Table of n, a(n) for n=0..9.
|
|
|
EXAMPLE
|
a(0)=86 because 2^86 = 77371252455336267181195264 is conjectured to be the highest power of 2 that doesn't contain the digit 0.
|
|
|
MATHEMATICA
|
f[n_] := Block[{a = {}, k = 1}, While[k < 10000, If[ Position[ Union[ IntegerDigits[ 2^k, 10]], n] == {}, AppendTo[a, k]]; k++ ]; a]; Table[ f[n][[ -1]], {n, 0, 9}] (from Robert G. Wilson v Jun 12 2004)
|
|
|
CROSSREFS
|
Sequence in context: A058907 A045101 A020215 * A095595 A095581 A097399
Adjacent sequences: A094773 A094774 A094775 * A094777 A094778 A094779
|
|
|
KEYWORD
|
nonn,fini,full,base
|
|
|
AUTHOR
|
Michael Taktikos, Jun 09 2004
|
|
|
EXTENSIONS
|
I believe these values have not been proved to be correct, but are only conjectures. - N. J. A. Sloane, Jun 10, 2004
|
|
|
STATUS
|
approved
|
| |
|
|
