OFFSET
0,2
REFERENCES
Archimedeans Problems Drive, Eureka, 14 (1951), 13.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..1000 (first 301 terms from T. D. Noe)
MAPLE
b:= proc(n) local m; m:= n; "";
while m>0 do irem(m, 9, 'm'), % od;
parse(cat(%))
end:
a:= n-> b(2^n):
seq(a(n), n=0..42); # Alois P. Heinz, Aug 21 2019
MATHEMATICA
Table[FromDigits[IntegerDigits[2^n, 9]], {n, 0, 30}] (* T. D. Noe, Jun 28 2012 *)
PROG
(PARI) {for(ixp=0, 34,
casi = 2^ixp; cvst=0;
while(casi != 0,
cvd = casi%9; cvst=10*cvst + cvd + 1; casi = (casi - cvd) / 9 );
while(cvst !=0,
ptch = cvst%10; print1(ptch-1); cvst = (cvst - ptch) / 10 );
print1(", "))} /* Douglas Latimer, Apr 23 2012 */
CROSSREFS
KEYWORD
easy,base,nonn
AUTHOR
EXTENSIONS
More terms from Douglas Latimer, Apr 16 2012
STATUS
approved