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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071292 Call f(n) the sum of the first n primes then a(n) is the number of squares between f(n) and f(n+1). 0
1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,8

COMMENTS

a(n)>=1.

LINKS

Table of n, a(n) for n=1..100.

Internet Math. Olympiad, February: Problem 1

MATHEMATICA

squareQ[n_] := IntegerQ[Sqrt[n]] f[n_] := Sum[Prime[i], {i, 1, n}] a[n_] := Length[Select[Table[i, {i, a[n], a[n + 1]}], squareQ]]

CROSSREFS

Sequence in context: A109495 A164295 A035214 * A088569 A246144 A192763

Adjacent sequences:  A071289 A071290 A071291 * A071293 A071294 A071295

KEYWORD

nonn

AUTHOR

Santi Spadaro, Jun 11 2002

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 11 22:31 EST 2019. Contains 329046 sequences. (Running on oeis4.)