Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141800
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141800 For n>=2, a(n) = sum{k=1 to n} (smallest prime dividing (n*k)). a(1)=0. +0
2
0, 4, 8, 8, 17, 12, 28, 16, 23 (list; graph; listen)
OFFSET

1,2

EXAMPLE

For n = 5, the smallest prime dividing 1*5=5 is 5. The smallest prime dividing 2*5=10 is 2. The smallest prime dividing 3*5=15 is 3. The smallest prime dividing 4*5=20 is 2. And the smallest prime dividing 5*5=25 is 5. So a(5) = 5+2+3+2+5 = 17.

CROSSREFS

Cf. A141801.

Sequence in context: A005877 A098354 A089474 this_sequence A019197 A066106 A030296

Adjacent sequences: A141797 A141798 A141799 this_sequence A141801 A141802 A141803

KEYWORD

more,nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jul 05 2008

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 December 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research