A129968 - OEIS

This site is supported by donations to The OEIS Foundation.

A129968

a(n) = sum of digits of A061909(n).

1, 2, 3, 1, 2, 3, 4, 2, 3, 4, 3, 4, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 4, 2, 3, 4, 3, 4, 5, 4, 5, 3, 4, 4, 5, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 4, 5, 2, 3, 4, 5, 3, 4, 5, 6, 4, 5, 6, 5, 3, 4, 5, 4, 5, 6, 5, 4, 5, 2, 3, 4, 3, 4, 5, 4, 5, 6, 3, 4, 5, 4, 5, 5, 6, 4, 5, 6, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 1, 2, 3, 4, 2, 3 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..5000`
	CROSSREFS	`Sequence in context: A053610 A104246 A007720 * A027615 A053737 A033924` `Adjacent sequences: A129965 A129966 A129967 * A129969 A129970 A129971`
	KEYWORD	`nonn,base`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Jun 13 2007`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.