

A259084


a(n) = largest k such that the decimal representation of prime(n)^k does not contain the digit 0.


1



86, 68, 58, 35, 41, 14, 27, 44, 10, 14, 16, 16, 9, 10, 8, 7, 14, 16, 14, 8, 6, 9, 4, 23, 8, 0, 14, 10, 12, 10, 6, 14, 5, 8, 5, 13, 7, 16, 7, 17, 6, 3, 9, 9, 16, 7, 12, 11, 4, 13, 7, 16, 8, 9, 3, 10, 4, 9, 6, 4, 5, 13, 3, 12, 7, 9, 6, 8, 4, 39, 13, 12, 10, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

These values are only conjectural.


LINKS

Popular Computing (Calabasas, CA), Two Tables, Vol. 1, (No. 9, Dec 1973), page PC916.


EXAMPLE

a(1)=86 because 2^86 = 77371252455336267181195264 is conjectured to be the highest power of 2 that doesn't contain the digit 0.


MAPLE

N:= 100: K:= 100: # to get a(1) to a(N), searching up to k = K
for n from 1 to N do
p:= ithprime(n);
A[n]:= 0;
for k from 1 to K do
if not has(convert(p^k, base, 10), 0) then
A[n]:= k
fi
od
od:


CROSSREFS



KEYWORD

nonn,base


AUTHOR



EXTENSIONS



STATUS

approved



