|
Search: id:A006970
|
|
|
| A006970 |
|
Euler pseudoprimes: 2^{(n-1)/2} == +- 1 mod n.
(Formerly M5442)
|
|
+0
1
|
|
| 341, 561, 1105, 1729, 1905, 2047, 2465, 3277, 4033, 4681, 5461, 6601, 8321, 8481, 10261, 10585, 12801, 15709, 15841, 16705, 18705, 25761, 29341, 30121, 31621, 33153, 34945, 41041, 42799
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. K. Guy, Unsolved Problems in Number Theory, A12.
|
|
LINKS
|
T. D. Noe, Euler pseudoprimes up to 10^8; table of n, a(n) for n = 1..1231
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Index entries for sequences related to pseudoprimes
|
|
CROSSREFS
|
Sequence in context: A025353 A025345 A001567 this_sequence A007324 A007011 A064907
Adjacent sequences: A006967 A006968 A006969 this_sequence A006971 A006972 A006973
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com), rgep(AT)chalcedon.demon.co.uk
|
|
EXTENSIONS
|
Faron Moller (fm(AT)csd.uu.se) corrected the 15th entry to 10261 from 10241.
|
|
|
Search completed in 0.002 seconds
|
