id:A071292 - OEIS Search Results

Search: id:A071292

Displaying 1-1 of 1 results found.

page 1

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, 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; listen)

	OFFSET	`1,8`
	COMMENT	`a(n)>=1.`
	LINKS	`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 this_sequence A088569 A001285 A088424` `Adjacent sequences: A071289 A071290 A071291 this_sequence A071293 A071294 A071295`
	KEYWORD	`nonn`
	AUTHOR	`Santi Spadaro (spados(AT)katamail.com), Jun 11 2002`

page 1

Search completed in 0.002 seconds

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.

AT&T Labs Research