id:A036450 - OEIS Search Results

Search: id:A036450

Displaying 1-1 of 1 results found.

page 1

a(n)=d[ d[ d[ n ] ] ], the 3rd iterate of number-of-divisors function with initial value of n.

+0
11

1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 3, 3, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 2, 2, 4, 2, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 4, 2, 2, 3, 3, 2, 3, 2, 3, 2, 2, 2, 4, 2, 2, 2, 3, 2, 4, 2, 3, 2, 2, 2, 4, 2, 3, 3, 2, 2, 3, 2, 3, 3 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`The iterated d function rapidly converges to the fixed point 2.`
	FORMULA	`a[ n ]=Nest[ d, n, 3 ]`
	EXAMPLE	`E.g. n=5040,d[ 5040 ]=60,d[ d[ 5040 ] ]=d[ 60 ]=12 and a[ 5040 ]=d[ 12 ]=6`
	CROSSREFS	`A000005, A015553, A036452, A036453.` `Sequence in context: A103379 A032550 A109399 this_sequence A085576 A108622 A112348` `Adjacent sequences: A036447 A036448 A036449 this_sequence A036451 A036452 A036453`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu)`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research