Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A139425
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A139425
Smallest number k such that M(n)^2-k*M(n)+1 is prime with M(n)= Mersenne primes =
A000668
(n).
+0
8
1, 1, 9, 3, 3, 25, 7, 21, 435, 241, 3, 153, 151, 493, 537, 2871, 1713, 4941, 4963, 307, 28413, 5035, 1615, 43525, 9973
(
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 18 21:37 EST 2009. Contains 171024 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
