id:A070560 - OEIS Search Results

Search: id:A070560

Displaying 1-1 of 1 results found.

page 1

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

+0
3

1, 12, 11, 11, 10, 3, 10, 9, 9, 8, 2, 10, 9, 9, 8, 3, 8, 8, 7, 5, 2, 7, 7, 6, 7, 4, 6, 7, 4, 5, 2, 5, 6, 4, 4, 3, 5, 5, 5, 4, 2, 6, 3, 4, 3, 5, 3, 4, 3, 6, 2, 7, 5, 10, 4, 3, 6, 4, 4, 3, 2, 4, 4, 7, 7, 4, 3, 3, 9, 7, 2, 6, 6, 4, 3, 3, 8, 7, 5, 4, 2, 6, 4, 3, 9, 5, 5, 5, 6, 5, 2, 3, 3 (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. A070561, A070562, A031346, A003001.` `Sequence in context: A022968 A023454 A055123 this_sequence A019330 A086045 A072220` `Adjacent sequences: A070557 A070558 A070559 this_sequence A070561 A070562 A070563`
	KEYWORD	`nonn,easy,base`
	AUTHOR	`njas, May 07 2002`

page 1

Search completed in 0.002 seconds

Last modified September 8 13:07 EDT 2008. Contains 143486 sequences.

AT&T Labs Research