login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078479 a(1)=1, a(n+1)=a(spf(n))+a(gpf(n)), where spf(n) and gpf(n) are the smallest and greatest prime factors of n (A020639, A006530). 0
1, 2, 4, 8, 4, 8, 6, 12, 4, 8, 6, 12, 6, 12, 8, 8, 4, 8, 6, 12, 6, 10, 8, 16, 6, 8, 8, 8, 8, 16, 6, 12, 4, 10, 6, 10, 6, 12, 8, 10, 6, 12, 8, 16, 8, 8, 10, 20, 6, 12, 6, 8, 8, 16, 6, 10, 8, 10, 10, 20, 6, 12, 8, 10, 4, 10, 8, 16, 6, 12, 8, 16, 6, 12, 8, 8, 8, 12, 8, 16, 6, 8, 8, 16, 8, 8, 10, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
CROSSREFS
Sequence in context: A021805 A031401 A191333 * A060968 A323651 A151569
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jan 03 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 17 22:31 EDT 2024. Contains 375237 sequences. (Running on oeis4.)