login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054725 a[1]=1; a[m]= sum[a[p-1]], where sum is over all primes (not necessarily distinct), p, that divide m. 1
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; refs; listen; history; internal format)
OFFSET

1,4

EXAMPLE

a[20] = a[2-1] +a[2-1] +a[5-1] =1 + 1 +2 =4 because 20 = 2*2*5.

CROSSREFS

Sequence in context: A089050 A167439 A125173 * A064415 A086833 A010764

Adjacent sequences:  A054722 A054723 A054724 * A054726 A054727 A054728

KEYWORD

nonn

AUTHOR

Leroy Quet Apr 20 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 14 08:58 EST 2012. Contains 205614 sequences.