Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062067
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062067 a(1) = 1; a(n) is smallest square > a(n-1) such that a(n) + a(n-1) is a prime. +0
2
1, 4, 9, 64, 169, 400, 529, 900, 961, 1936, 2401, 5476, 6241, 6400, 7921, 9216, 10201, 10816, 11025, 13456, 14161, 15376, 17161, 17956, 19321, 19600, 22201, 22500, 24649, 24964, 27225, 29584, 29929, 31684, 33489, 40804, 41209, 52900 (list; graph; listen)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

EXAMPLE

9 is the next term after 4 as 4+9 = 13 is a prime.

PROGRAM

(PARI) p=1:n=2:for(k=1, 50, while(!isprime(p^2+n^2), n=n+1):print1(n^2", "):p=n:n=n+1)

(PARI) { a=b=1; for (n=1, 1000, if (n>1, until (isprime(a + b^2), b++)); write("b062067.txt", n, " ", a=b^2) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 31 2009]

CROSSREFS

Sequence in context: A124683 A077163 A069711 this_sequence A110256 A095175 A055859

Adjacent sequences: A062064 A062065 A062066 this_sequence A062068 A062069 A062070

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 12 2001

EXTENSIONS

Corrected and extended by Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 22 2003

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 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research