login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

A066001
Sum of digits of 5^n.
23
1, 5, 7, 8, 13, 11, 19, 23, 25, 26, 40, 38, 28, 23, 34, 44, 58, 56, 64, 59, 61, 62, 67, 74, 82, 77, 79, 89, 85, 83, 91, 104, 106, 89, 103, 92, 109, 104, 124, 134, 130, 137, 145, 149, 151, 116, 112, 128, 145, 158, 151, 152, 130, 119, 127, 167, 196
OFFSET
0,2
COMMENTS
We can expect and conjecture that a(n) ~ 4.5*log_10(5)*n, but for n ~ 10^3..10^4 there are still fluctuations of +- 1%, e.g., a(10^3)/log_10(5) ~ 4538, a(10^4)/log_10(5) ~ 44518. Modulo 9, the sequence is periodic with period (1, 5, 7, 8, 4, 2) of length 6. No term is divisible by 3, a(n) = (-1)^n (mod 3). - M. F. Hasler, May 18 2017
LINKS
MATHEMATICA
Table[ Total@ IntegerDigits[5^n], {n, 0, 60}] (* Robert G. Wilson v Oct 25 2006 *).
Table[Total[IntegerDigits[5^n]], {n, 0, 60}] (* Vincenzo Librandi, Oct 08 2013 *)
PROG
(PARI) A066001=a(n)=sumdigits(5^n); \\ Michel Marcus, Sep 04 2014
CROSSREFS
Cf. sum of digits of k^n: A001370 (k=2), A004166 (k=3), A065713 (k=4), this sequence (k=5), A066002 (k=6), A066003 (k=7), A066004 (k=8), A065999 (k=9), A066005 (k=11), A066006 (k=12), A175527 (k=13).
Sequence in context: A257772 A356897 A314374 * A320391 A047477 A216555
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Dec 11 2001
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy