id:A054725 - OEIS Search Results

Search: id:A054725

Displaying 1-1 of 1 results found.

page 1

a[1]=1; a[m]= sum[a[p-1]], where sum is over all primes (not necessarily distinct), p, that divide m.

+0
2

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

	OFFSET	`1,4`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	EXAMPLE	`a[20] = a[2-1] +a[2-1] +a[5-1] =1 + 1 +2 =4 because 20 = 225.`
	CROSSREFS	`Sequence in context: A068211 A089050 A125173 this_sequence A064415 A086833 A010764` `Adjacent sequences: A054722 A054723 A054724 this_sequence A054726 A054727 A054728`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet Apr 20 2000`

page 1

Search completed in 0.005 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research