id:A001370 - OEIS Search Results

Search: id:A001370

Displaying 1-1 of 1 results found.

page 1

Sum of digits of 2^n.
(Formerly M1085 N0414)

+0
13

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.`
	LINKS	`Zak Seidov, Table of n, a(n) for n = 0..10000.`
	CROSSREFS	`Adjacent sequences: A001367 A001368 A001369 this_sequence A001371 A001372 A001373` `Sequence in context: A029898 A021406 A065075 this_sequence A039794 A113417 A113419`
	KEYWORD	`base,nonn`
	AUTHOR	`njas, Simon Plouffe (plouffe(AT)math.uqam.ca)`

page 1

Search completed in 0.002 seconds

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.

AT&T Labs Research