login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006970 Euler pseudoprimes: 2^{(n-1)/2} == +- 1 mod n.
(Formerly M5442)
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; refs; listen; history; internal format)
OFFSET

1,1

REFERENCES

R. K. Guy, Unsolved Problems in Number Theory, A12.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

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

MATHEMATICA

ok[_?PrimeQ] = False; ok[n_] := (p = PowerMod[2, (n - 1)/2, n]; p == Mod[1, n] || p == Mod[-1, n]); Select[2 Range[22000] + 1, ok] (* From Jean-François Alcover, Apr 06 2011 *)

CROSSREFS

Sequence in context: A025345 A001567 A178723 * A007324 A007011 A064907

Adjacent sequences:  A006967 A006968 A006969 * 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.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 19:37 EST 2012. Contains 205663 sequences.