id:A062069 - OEIS Search Results

Search: id:A062069

Displaying 1-1 of 1 results found.

page 1

A062069

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

+0
6

1, 3, 3, 4, 3, 7, 3, 7, 4, 7, 3, 12, 3, 7, 7, 6, 3, 12, 3, 12, 7, 7, 3, 15, 4, 7, 7, 12, 3, 15, 3, 12, 7, 7, 7, 13, 3, 7, 7, 15, 3, 15, 3, 12, 12, 7, 3, 18, 4, 12, 7, 12, 3, 15, 7, 15, 7, 7, 3, 28, 3, 7, 12, 8, 7, 15, 3, 12, 7, 15, 3, 28, 3, 7, 12, 12, 7, 15, 3, 18, 6, 7, 3, 28, 7, 7, 7, 15, 3 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`sigma(d(12)) = sigma(6) = 12.`
	PROGRAM	`(PARI) v=[]; for(n=1, 150, v=concat(v, sigma(numdiv(n)))); v`
	CROSSREFS	`Cf. A062068.` `Sequence in context: A130896 A029882 A083503 this_sequence A027011 A061023 A057690` `Adjacent sequences: A062066 A062067 A062068 this_sequence A062070 A062071 A062072`
	KEYWORD	`nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 13 2001`
	EXTENSIONS	`More terms from Jason Earls (zevi_35711(AT)yahoo.com), Jun 19 2001`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research