Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078479
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
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; listen)
OFFSET

1,2

CROSSREFS

Sequence in context: A059884 A021805 A031401 this_sequence A060968 A016635 A133992

Adjacent sequences: A078476 A078477 A078478 this_sequence A078480 A078481 A078482

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 03 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 8 13:03 EDT 2008. Contains 143486 sequences.


AT&T Labs Research