Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132955
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132955 Smallest prime in a sequence of n consecutive primes which add to a perfect square. +0
3
17, 13, 5, 181, 587, 13, 163, 2, 13789, 1013, 163, 653, 11, 3931, 397, 2039, 439, 4447, 1217, 269, 1733, 3, 5, 2239, 197, 3, 1061, 14563, 1901, 3, 149, 359, 2137, 67, 433, 11, 907, 2339, 673, 19181, 11593, 89, 6883, 3, 28571, 997, 43, 3559, 2287, 1931, 911 (list; graph; listen)
OFFSET

2,1

FORMULA

a(n)={ min prime(k): [ sum(j=k..k+n-1) prime(j)] in A000290}. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 27 2007

EXAMPLE

a(2)=17, because it is the smallest prime in a sequence of n=2 consecutive primes, which add to a perfect square, namley 17+19=36=6^2. The sums of earlier pairs, 2+3, 3+5, 5+7, 7+11 etc. fail to produces sums which are any perfect square.

CROSSREFS

Cf. A132956 A132957.

Cf. A132956, A132957.

Sequence in context: A106791 A040274 A073887 this_sequence A063518 A089502 A128158

Adjacent sequences: A132952 A132953 A132954 this_sequence A132956 A132957 A132958

KEYWORD

easy,nonn

AUTHOR

Enoch Haga (Enokh(AT)comcast.net), Sep 06 2007

EXTENSIONS

Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 27 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 15:51 EST 2008. Contains 151308 sequences.


AT&T Labs Research