|
Search: id:A120378
|
|
|
| A120378 |
|
Integers n such that 2*11^n-1 is prime. |
|
+0
1
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
See comments for A057472. Examined in base 12, all n must be even and all primes must be 1-primes. For example, 241 is 181 in base 12.
|
|
FORMULA
|
a(n) = n-th integer k such that 2*11^k-1 is prime.
|
|
EXAMPLE
|
a(1)=2 since 2*11^2-1=241 is the first prime.
|
|
MAPLE
|
for w to 1 do for k from 1 to 2000 do n:=2*11^k-1; if isprime(n) then printf("%d, %d", k, n) fi od od;
|
|
CROSSREFS
|
Cf. A000043, A000668, A002957, A002959, A003307, A079363, A055558.
Sequence in context: A125264 A028985 A067583 this_sequence A012345 A012341 A012296
Adjacent sequences: A120375 A120376 A120377 this_sequence A120379 A120380 A120381
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Walter Kehowski (wkehowski(AT)cox.net), Jun 28 2006
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)cs.stanford.edu), Jan 14 2008
|
|
|
Search completed in 0.002 seconds
|
