

A106546


a(n) = n^2 if n^2 is the difference of two primes, otherwise a(n) = 0.


5



1, 4, 9, 16, 0, 36, 0, 64, 81, 100, 0, 144, 0, 196, 225, 256, 0, 324, 0, 400, 441, 484, 0, 576, 0, 676, 0, 784, 0, 900, 0, 1024, 1089, 1156, 0, 1296, 0, 1444, 1521, 1600, 0, 1764, 0, 1936, 2025, 2116, 0, 2304, 0, 2500, 0, 2704, 0, 2916, 0, 3136, 3249, 3364, 0, 3600, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

For odd n, n^2 is odd so the two primes must be opposite in parity. Lesser prime must be 2 and greater prime must be n^2+2. Thus for odd n, n^2 is the difference of two primes iff n^2+2 is prime.
An odd difference can be obtained only by subtracting 2 from some prime > 2, hence a(n) = 0 if n is odd and n^2+2 is composite.


LINKS

Table of n, a(n) for n=1..61.


FORMULA

n^2  A106546 gives perfect squares which are not the difference of two primes (otherwise 0).


EXAMPLE

a(6) = 6^2 = 36 = 415 (two primes).
a(5) = 0 and a(7) = 0 because 5^2+2 =27 = 3*3*3 and 7^2+2 =51 = 3*17 are composite.


CROSSREFS

Cf. A106544A106548, A106562A106564, A106571, A106573A106575, A106577.
Sequence in context: A337568 A070447 A106548 * A276191 A007893 A070446
Adjacent sequences: A106543 A106544 A106545 * A106547 A106548 A106549


KEYWORD

easy,nonn


AUTHOR

Alexandre Wajnberg, May 08 2005


EXTENSIONS

Edited and extended by Klaus Brockhaus and Ray Chandler, May 12 2005


STATUS

approved



