OFFSET
1,1
COMMENTS
For any n >= 3, a(n) is of the form a(n) = 27 + 6m, m >= 0 integer. This follows from the simple fact that for any prime p >= 5, (p + 5)(p - 5) is divisible by 6. - Shai Covo (green355(AT)netvision.net.il), Oct 04 2010
REFERENCES
David M. Burton, Elementary Number Theory, Allyn and Bacon, Inc. Boston, MA, 1976, pp. 51.
LINKS
Harry J. Smith, Table of n, a(n) for n = 1..1000
MAPLE
MATHEMATICA
Prime[Range[40]]^2 + 2 (* Geoffrey Critzer, Feb 01 2015 *)
PROG
(PARI) v=[]; for(n=1, 100, v=concat(v, (prime(n)^2)+2)); v
(PARI) { n=0; forprime (p=2, prime(1000), write("b061725.txt", n++, " ", p^2 + 2) ) } \\ Harry J. Smith, Jul 27 2009
(Magma) [p^2+2: p in PrimesUpTo(200)]; // Vincenzo Librandi, Mar 22 2015
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jason Earls, Jun 23 2001
STATUS
approved