Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134228
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134228 Sum of the odd primes <= 2*10^n. +0
3
75, 4225, 277048, 21171189, 1709600811, 142913828920, 12272577818050, 1075207199997332 (list; graph; listen)
OFFSET

1,1

FORMULA

Beginning with 3, compute 10^n sums of odds, less odd composites, for each 10^n.

a(n)=sum(p: p in A000040, 2<p <=2*10^n). a(n)=A007504(k)-2, where k=A049084[A007917(2*10^n)]. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 28 2007

EXAMPLE

a(1)=75 because that is the sum of odds (3+5+7+11+13+17+19=75) less composites (9,15,21) under 10^1 (beginning with 3).

CROSSREFS

Cf. A134229 A134230.

Sequence in context: A017791 A017738 A075913 this_sequence A110902 A114910 A093275

Adjacent sequences: A134225 A134226 A134227 this_sequence A134229 A134230 A134231

KEYWORD

more,nonn

AUTHOR

Enoch Haga (Enokh(AT)comcast.net), Oct 14 2007

EXTENSIONS

Better definition from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 28 2007

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research