A096335 - OEIS

This site is supported by donations to The OEIS Foundation.

A096335

Number of iterations of n -> n + tau(n) needed for the trajectory of n to join the trajectory of A064491.

0, 0, 2, 0, 1, 3, 0, 1, 0, 2, 8, 0, 7, 1, 6, 5, 6, 0, 5, 3, 4, 3, 4, 0, 3, 2, 13, 2, 13, 1, 12, 0, 11, 1, 10, 8, 10, 0, 9, 7, 9, 0, 8, 1, 7, 1, 8, 6, 7, 0, 6, 6, 6, 5, 5, 0, 4, 5, 4, 26, 3, 4, 2, 0, 2, 3, 2, 3, 1, 2, 0, 25, 0, 2, 0, 2, 1, 1, 1, 1, 0, 1, 39, 24, 38, 0, 37, 24, 37, 0, 36, 4, 36, 4, 35, 23 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,3`
	COMMENTS	`Conjecture: For any positive integer starting value n, iterations of n -> n + tau(n) will eventually join A064491 (verified for all n up to 50000).`
	EXAMPLE	`a(6)=3 because the trajectory for 1 (sequence A064491) starts` `1->2->4->7->9->12->18->24->32->38->42...` `and the trajectory for 6 starts` `6->10->14->18->24->32->38->42->50->56...` `so the sequence beginning with 6 joins A064491 after 3 steps.`
	CROSSREFS	`Cf. A000005.` `Sequence in context: A154312 A119900 A141097 * A191910 A129503 A144185` `Adjacent sequences: A096332 A096333 A096334 * A096336 A096337 A096338`
	KEYWORD	`nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jun 28 2004`

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

Last modified February 15 17:46 EST 2012. Contains 205835 sequences.