id:A096287 - OEIS Search Results

Search: id:A096287

Displaying 1-1 of 1 results found.

page 1

Number of iterations of n -> n + (product of nonzero digits of n) needed for the trajectory of n to join the trajectory of A063108.

+0
3

0, 0, 5, 0, 6, 4, 3, 0, 2, 5, 4, 3, 1, 2, 2, 0, 3, 1, 5, 1, 10, 0, 9, 2, 7, 0, 9, 4, 8, 8, 5, 1, 7, 4, 6, 2, 15, 0, 2, 4, 8, 6, 5, 3, 7, 3, 7, 4, 16, 5, 17, 1, 2, 1, 4, 16, 7, 14, 1, 2, 4, 0, 322, 3, 6, 1, 3, 1, 17, 2, 16, 16, 17, 0, 6, 2, 1, 15, 14, 3, 321, 14, 4, 1, 15, 15, 13, 2, 320, 12, 3, 6, 2, 16 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`Loomis has verified that all n up to 1000000 eventually join the trajectory of A063108.`
	LINKS	`P. A. Loomis, An Interesting Family of Iterated Sequences.`
	EXAMPLE	`a(3)=5 because the trajectory for 1 (Sequence A063108) starts` `1->2->4->8->16->22->26->38->62->74...` `and the sequence for 3 starts` `3->6->12->14->18->26->38->62->74...` `so the sequence beginning with 3 joins A063108 after 5 steps.`
	CROSSREFS	`Sequence in context: A004552 A130415 A035550 this_sequence A098403 A069206 A091685` `Adjacent sequences: A096284 A096285 A096286 this_sequence A096288 A096289 A096290`
	KEYWORD	`base,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jun 23 2004`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research