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.

A175527 Digit sum of 13^n.

Original entry on oeis.org

1, 4, 16, 19, 22, 25, 37, 40, 34, 46, 67, 52, 55, 58, 97, 73, 85, 88, 91, 85, 115, 91, 121, 106, 109, 121, 133, 118, 121, 133, 163, 184, 169, 181, 193, 169, 172, 175, 178, 199, 193, 214, 226, 238, 169, 190, 247, 241, 208, 247, 232, 253, 292, 241, 316, 292, 268, 271, 301, 286, 298, 337, 304, 325
Offset: 0

Views

Author

N. J. A. Sloane, Dec 03 2010

Keywords

Comments

It is surprising that many values repeat twice (for 85, 91, 121, 133, 169 this happens at a(n) = a(n+3) (but 169 occurs later for a third time), for 193, 241, 292, ... the second occurrence comes later) while many other values never occur. Is there a simple explanation? - M. F. Hasler, May 18 2017

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), A066005 (k=11), A066006 (k=12), this sequence (k=13).

Programs

  • Mathematica
    Table[Total[IntegerDigits[13^k]], {k,0,1000}]
  • PARI
    a(n)=sumdigits(13^n); \\ Michel Marcus, Nov 01 2013

Formula

a(n) = A007953(A001022(n)). - Michel Marcus, Nov 01 2013
a(n) ~ 4.5*log_10(13)*n ~ 5.0127*n (conjectured). - M. F. Hasler, May 18 2017