Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A006970
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
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
)
page 1
Search completed in 0.001 seconds
Lookup
|
Welcome
|
Find friends
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Transforms
|
Puzzles
|
Hot
|
Classics
More pages
|
Superseeker
|
Maintained by
N. J. A. Sloane
(
njas@research.att.com
)
Last modified December 17 23:40 EST 2009. Contains 171025 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
