|
|
A178954
|
|
Primes prime(j) which cannot be written as 2*prime(j) = prime(j+k) + prime(j-k) for any 0 < k < j.
|
|
3
|
|
|
2, 3, 7, 19, 23, 43, 47, 73, 79, 109, 113, 149, 163, 199, 223, 227, 229, 239, 241, 269, 271, 281, 283, 293, 313, 317, 463, 467, 499, 503, 509, 523, 619, 659, 661, 673, 677, 683, 691, 719, 829, 839, 859, 883, 887, 967, 1049, 1063, 1069, 1109, 1117, 1129, 1153, 1163, 1201
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Sequence A127925, in which 2*prime(j) < prime(j+k) + prime(j-k) for all 0 < k < j, is a subsequence of this sequence. According to section A14 of Guy, Pomerance proved that A127925 is an infinite sequence. Hence, this sequence is also infinite. - T. D. Noe, Jan 10 2011
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Number Theory, 3rd ed. Springer, 2004.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
A178609 := proc(n) for k from n-1 to 0 by -1 do if ithprime(n-k)+ithprime(n+k)=2*ithprime(n) then return k; end if; end do: end proc:
for n from 1 to 200 do if A178609(n) = 0 then printf("%d, ", ithprime(n)) ; end if; end do: # R. J. Mathar, Jan 05 2011
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|