Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101306
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101306 a(n) = sum_{i=1..n} {last digit of prime(i)}. +0
3
2, 5, 10, 17, 18, 21, 28, 37, 40, 49, 50, 57, 58, 61, 68, 71, 80, 81, 88, 89, 92, 101, 104, 113, 120, 121, 124, 131, 140, 143, 150, 151, 158, 167, 176, 177, 184, 187, 194, 197, 206, 207, 208, 211, 218, 227, 228, 231, 238, 247, 250, 259, 260, 261, 268, 271, 280 (list; graph; listen)
OFFSET

1,1

COMMENT

Asymptotically, a(n) ~ 5n by Dirichlet's theorem. [From Charles R Greathouse IV, Sep 28 2008]

FORMULA

Partial sums of A007652.

EXAMPLE

a(1)=2

a(2)=2+3

a(3)=2+3+5

a(4)=2+3+5+7

a(5)=2+3+5+7+1(1)= 2+3+5+7+1

MATHEMATICA

f[n_] := Sum[ Mod[ Prime[i], 10], {i, n}]; Table[ f[n], {n, 60}] (from Robert G. Wilson v Dec 22 2004)

PROGRAM

(PARI) sum(k=1, n, prime(k)%10) [From Charles R Greathouse IV, Sep 28 2008]

CROSSREFS

Sequence in context: A079984 A027613 A067112 this_sequence A051351 A111925 A030723

Adjacent sequences: A101303 A101304 A101305 this_sequence A101307 A101308 A101309

KEYWORD

nonn,base,easy

AUTHOR

Jorge Coveiro (jorgecoveiro(AT)yahoo.com), Dec 22 2004

EXTENSIONS

Corrected and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 22 2004

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 November 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research