|
Search: id:A045535
|
|
|
| A045535 |
|
a(n) = least negative pseudosquare modulo the first n odd primes.
(Formerly M4381 N2226)
|
|
+0
7
|
|
| 7, 23, 71, 311, 479, 1559, 5711, 10559, 18191, 31391, 118271, 366791, 366791, 2155919, 2155919, 2155919, 6077111, 6077111, 98538359, 120293879, 131486759, 131486759, 508095719, 2570169839, 2570169839, 2570169839, 2570169839
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(n) is the smallest positive integer m such that m == 7 (mod 8) and for the first n odd primes p, -m is a (nonzero) quadratic residue mod p.
|
|
REFERENCES
|
N. D. Bronson and D. A. Buell, Congruential sieves on FPGA computers, pp. 547-551 of Mathematics of Computation 1943-1993 (Vancouver, 1993), Proc. Symp. Appl. Math., Vol. 48, Amer. Math. Soc. 1994.
D. H. Lehmer, E. Lehmer and D. Shanks, Integer sequences having prescribed quadratic character, Math. Comp., 24 (1970), 433-451.
|
|
LINKS
|
Index entries for sequences related to pseudoprimes
|
|
CROSSREFS
|
Cf. A062241.
Cf. A002189, A062241.
Sequence in context: A005342 A139852 A141194 this_sequence A001984 A002223 A034563
Adjacent sequences: A045532 A045533 A045534 this_sequence A045536 A045537 A045538
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
The Bronson-Buell reference gives terms through 227. The Math. Comp. version is erroneous.
Edited by Don Reble (djr(AT)nk.ca), Nov 14 2006
|
|
|
Search completed in 0.002 seconds
|
