|
Search: id:A001370
|
|
|
| A001370 |
|
Sum of digits of 2^n.
(Formerly M1085 N0414)
|
|
+0
14
|
|
| 1, 2, 4, 8, 7, 5, 10, 11, 13, 8, 7, 14, 19, 20, 22, 26, 25, 14, 19, 29, 31, 26, 25, 41, 37, 29, 40, 35, 43, 41, 37, 47, 58, 62, 61, 59, 64, 56, 67, 71, 61, 50, 46, 56, 58, 62, 70, 68, 73, 65, 76, 80, 79, 77, 82, 92, 85, 80, 70, 77
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Same digital roots as A065075 (Sum of digits of the sum of the preceding numbers) and A004207 (sum of digits of all previous terms); they enter into the cycle {1 2 4 8 7 5}. - Alexandre wajnberg (alexandre.wajnberg(AT)skynet.be), Dec 11 2005
|
|
REFERENCES
|
Archimedeans Problems Drive, Eureka, 26 (1963), 12.
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
|
Zak Seidov, Table of n, a(n) for n = 0..10000.
|
|
CROSSREFS
|
Sequence in context: A029898 A021406 A065075 this_sequence A039794 A113417 A113419
Adjacent sequences: A001367 A001368 A001369 this_sequence A001371 A001372 A001373
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
|
|
|
Search completed in 0.002 seconds
|
