cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A066005 Sum of digits of 11^n.

Original entry on oeis.org

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
Offset: 0

Views

Author

N. J. A. Sloane, Dec 11 2001

Keywords

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).

Programs

  • Mathematica
    Total/@(IntegerDigits/@(11^Range[0,60])) (* Harvey P. Dale, Nov 02 2011 *)
  • PARI
    a(n) = sumdigits(11^n); \\ Michel Marcus, Nov 01 2013

Formula

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