base such..

[Cl Lenormand]

There was a typo mistake:

number of bases b (2 <= b <= k^n)
such that every digit of k^n in base b is 0 or 1,
where k is not a power:

  f(2^n)=1  3  3  4  3  5  3  6  4  5  3  7  3  5  5  6  3  7  3  7  5  
5  3  9...
   f(3^n)=2  4  4  6  4  6  4  6  5  6  4  8  4  6  6  7...
   f(5^n)=3  4  4  5  4  6  4  6  5  6  4  8...
   f(6^n)=3  5  4  6  4  6  4  7  5  6  4...
   f(7^n)=3  4  5  5  4  6  4  6  5  6...
f(10^n)=4  4  5  5  4  6  4  6  5...
f(11^n)=3  5  4  5  4  7  4  6...
f(12^n)=4  4  4  7  4  6  4  6...
f(13^n)=4  4  5  5  4  6  4...
f(14^n)=3  4  5  5  4  6  4...
f(15^n)=3  4  4  5  4  6  4...
f(17^n)=4  4  4  5  4  6  4...
f(18^n)=3  6  4  5  4  6  4...
f(19^n)=3  5  4  5  4  6...
f(20^n)=4  5  4  5  4  6...
f(21^n)=4  4  4  5  4  6...
f(22^n)=3  4  4  5  4  6...
f(23^n)=3  4  4  5  4  6...
f(24^n)=3  5  4  6  4  6...
f(26^n)=4  4  4  5  4  6...
f(28^n)=4  4  5  5  4  6...

Sorry.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: text/enriched
Size: 1057 bytes
Desc: not available
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20050308/8b709773/attachment.bin>