|
%I #2 Oct 03 2013 09:37:43
%S 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 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 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 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 a(n)>=1.
%H Internet Math. Olympiad, <a href="http://MathOlymp.com/OLYMP/Feb02/Feb02.html">February: Problem 1</a>
%t 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]]
%K nonn
%O 1,8
%A _Santi Spadaro_, Jun 11 2002
|
