login
This site is supported by donations to The OEIS Foundation.

 

Logo

The October issue of the Notices of the Amer. Math. Soc. has an article about the OEIS.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062048 a(n) = Sum{k=1...n} floor(sqrt(prime(k))). 3
1, 2, 4, 6, 9, 12, 16, 20, 24, 29, 34, 40, 46, 52, 58, 65, 72, 79, 87, 95, 103, 111, 120, 129, 138, 148, 158, 168, 178, 188, 199, 210, 221, 232, 244, 256, 268, 280, 292, 305, 318, 331, 344, 357, 371, 385, 399, 413, 428, 443, 458, 473, 488, 503, 519, 535, 551 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

MAPLE

P:=proc(n) local k, i; for i from 1 by 1 to n do print(sum('trunc(evalf(sqrt(ithprime(k)), 50))', 'k'=1..i)); od; end: P(101); # Paolo P. Lava, Feb 05 2008

MATHEMATICA

Accumulate[Floor[Sqrt[#]]&/@Prime[Range[60]]] (* Harvey P. Dale, May 08 2013 *)

PROG

(PARI) default(realprecision, 100);

for (n=1, 1000, write("b062048.txt", n, " ", sum(k=1, n, floor(sqrt(prime(k)))))) \\ Harry J. Smith, Jul 30 2009

(PARI) a(n)=my(s); forprime(p=2, prime(n), s+=sqrtint(p)); s \\ Charles R Greathouse IV, Jan 06 2016

CROSSREFS

Cf. A062009.

Sequence in context: A145196 A061536 A095114 * A194174 A168048 A075354

Adjacent sequences:  A062045 A062046 A062047 * A062049 A062050 A062051

KEYWORD

easy,nonn

AUTHOR

Dean Hickerson, Jun 30 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 25 01:17 EDT 2018. Contains 315360 sequences. (Running on oeis4.)