|
| |
|
|
A156585
|
|
Numbers such that (2^(n^2)-1)/(2^n-1) is prime.
|
|
0
| | |
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| It is easy to see that all terms of this sequence must be prime; this motivates the definition of A051156(n) = (2^prime(n)^2-1)/(2^prime(n)-1).
|
|
|
PROG
| (PARI) for/*prime*/( n=0, 99, is/*pseudo*/prime( (2^n^2-1)/(2^n-1) ) & print1(n, ", "))
|
|
|
CROSSREFS
| Cf. A051156.
Sequence in context: A075461 A059785 A159611 * A087358 A057736 A181263
Adjacent sequences: A156582 A156583 A156584 * A156586 A156587 A156588
|
|
|
KEYWORD
| hard,more,nonn
|
|
|
AUTHOR
| M. F. Hasler (www.univ-ag.fr/~mhasler), Feb 10 2009
|
| |
|
|
