id:A062068 - OEIS Search Results

Search: id:A062068

Displaying 1-1 of 1 results found.

page 1

A062068

a(n) = d(sigma(n)), where d(k) is the number of divisors function (A000005) and sigma(k) is the sum of divisor function (A000203).

+0
13

1, 2, 3, 2, 4, 6, 4, 4, 2, 6, 6, 6, 4, 8, 8, 2, 6, 4, 6, 8, 6, 9, 8, 12, 2, 8, 8, 8, 8, 12, 6, 6, 10, 8, 10, 4, 4, 12, 8, 12, 8, 12, 6, 12, 8, 12, 10, 6, 4, 4, 12, 6, 8, 16, 12, 16, 10, 12, 12, 16, 4, 12, 8, 2, 12, 15, 6, 12, 12, 15, 12, 8, 4, 8, 6, 12, 12, 16, 10, 8, 3, 12, 12, 12, 12, 12 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`d(sigma(5)) = d(6) = 4.`
	PROGRAM	`(PARI) for(n=1, 120, print(numdiv(sigma(n))))`
	CROSSREFS	`Sequence in context: A043263 A118978 A006047 this_sequence A130542 A128502 A079159` `Adjacent sequences: A062065 A062066 A062067 this_sequence A062069 A062070 A062071`
	KEYWORD	`nonn,easy`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 13 2001`
	EXTENSIONS	`Corrected and extended by Jason Earls (zevi_35711(AT)yahoo.com), Jun 16 2001`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research