The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A066005 revision #11

A066005

Sum of digits of 11^n.

1, 2, 4, 8, 16, 14, 28, 38, 40, 53, 43, 41, 55, 47, 76, 71, 88, 86, 82, 83, 94, 71, 97, 95, 118, 101, 112, 125, 124, 140, 145, 137, 139, 143, 178, 140, 172, 200, 184, 188, 205, 203, 190, 164, 175, 215, 196, 248, 190, 218, 265, 251, 223, 230

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,1000

FORMULA

a(n) = A007953(A001020(n)). - Michel Marcus, Nov 01 2013

MATHEMATICA

Total/@(IntegerDigits/@(11^Range[0, 60])) (* From Harvey P. Dale, Nov 02 2011 *)

PROG

(PARI) SumD(x)= { local(s=0); while (x>9, s+=x%10; x\=10); return(s + x) } { f=1; for (n=0, 1000, a=SumD(f); f*=11; write("b066005.txt", n, " ", a) ) } [From Harry J. Smith, Nov 06 2009]

(PARI) a(n) = sumdigits(11^n); \\ Michel Marcus, Nov 01 2013

CROSSREFS

Cf. sum of digits of k^n: A001370 (k=2), A004166 (k=3), A065713 (k=4), A066001 (k=5), A066002 (k=6), A066003 (k=7), A066004 (k=8), A065999 (k=9), this sequence (k=11), A066006 (k=12), A175527 (k=13).

Sequence in context: A334629 A358708 A108565 * A066600 A210025 A309571

Adjacent sequences: A066002 A066003 A066004 * A066006 A066007 A066008

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane, Dec 11 2001

STATUS

editing