|
Search: id:A097934
|
|
|
| A097934 |
|
Primes p such that p divides 3^((p-1)/2) - 2^((p-1)/2). |
|
+0
5
|
|
| 5, 19, 23, 29, 43, 47, 53, 67, 71, 73, 97, 101, 139, 149, 163, 167, 173, 191, 193, 197, 211, 239, 241, 263, 269, 283, 293, 307, 311, 313, 317, 331, 337, 359, 379, 383, 389, 409, 431, 433, 457, 461, 479, 499, 503, 509, 523, 547, 557, 571, 577, 599, 601, 619
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
x=3,d=1,s=-1 in pari program.
All terms belong to A038876(n) = Primes p such that 6 is a square mod p. Only two first terms of A038876(n), 2 and 3, do not belong to a(n). - Alexander Adamchuk (alex(AT)kolmogorov.com), May 04 2007
|
|
FORMULA
|
a(n) = A038876(n+1). - Alexander Adamchuk (alex(AT)kolmogorov.com), May 04 2007
|
|
EXAMPLE
|
For p=5, 3^2 - 2^2 = 5.
|
|
PROGRAM
|
(PARI) \s = +-1, d=diff ptopm1d2(n, x, d, s) = { forprime(p=3, n, p2=(p-1)/2; y=x^p2 + s*(x-d)^p2; if(y%p==0, print1(p", "))) }
|
|
CROSSREFS
|
Cf. A038876 = Primes p such that 6 is a square mod p.
Sequence in context: A087840 A074229 A152912 this_sequence A146509 A062340 A167766
Adjacent sequences: A097931 A097932 A097933 this_sequence A097935 A097936 A097937
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Sep 04 2004
|
|
|
Search completed in 0.002 seconds
|
