id:A070561 - OEIS Search Results

Search: id:A070561

Displaying 1-1 of 1 results found.

page 1

a(0) = 0; for n > 0, a(n) = (fecundity of n) + 1.

+0
3

0, 11, 10, 10, 9, 2, 9, 8, 8, 7, 1, 9, 8, 8, 7, 2, 7, 7, 6, 4, 1, 6, 6, 5, 6, 3, 5, 6, 3, 4, 1, 4, 5, 3, 3, 2, 4, 4, 4, 3, 1, 5, 2, 3, 2, 4, 2, 3, 2, 5, 1, 6, 4, 9, 3, 2, 5, 3, 3, 2, 1, 3, 3, 6, 6, 3, 2, 2, 8, 6, 1, 5, 5, 3, 2, 2, 7, 6, 4, 3, 1, 5, 3, 2, 8, 4, 4, 4, 5, 4, 1, 2, 2 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`Start with n, repeatedly replace x by x + product of digits of x until reach 0; fecundity = number of steps - 1.`
	EXAMPLE	`1 -> 2 -> 4 -> 8 -> 16 -> 22 -> 26 -> 38 -> 62 -> 74 ->102 -> 0 has fecundity 10.`
	CROSSREFS	`Cf. A070560. A070562, A031346, A003001.` `Sequence in context: A055122 A004452 A112952 this_sequence A059941 A086100 A004283` `Adjacent sequences: A070558 A070559 A070560 this_sequence A070562 A070563 A070564`
	KEYWORD	`nonn,easy,base`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), May 07 2002`

page 1

Search completed in 0.002 seconds

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.

AT&T Labs Research