%I A071292
%S A071292 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,
%T A071292 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,
%U A071292 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
%N 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).
%C A071292 a(n)>=1.
%H A071292 Internet Math. Olympiad, <a href="http://MathOlymp.com/OLYMP/Feb02/Feb02.html">
               February: Problem 1</a>
%t A071292 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]]
%Y A071292 Sequence in context: A109495 A164295 A035214 this_sequence A088569 A001285 
               A088424
%Y A071292 Adjacent sequences: A071289 A071290 A071291 this_sequence A071293 A071294 
               A071295
%K A071292 nonn
%O A071292 1,8
%A A071292 Santi Spadaro (spados(AT)katamail.com), Jun 11 2002