|
Search: id:A035089
|
|
|
| A035089 |
|
Smallest prime of form 2^n*k+1, i.e. an arithmetical progression with 2^n differences. |
|
+0
8
|
|
| 3, 5, 17, 17, 97, 193, 257, 257, 7681, 12289, 12289, 12289, 40961, 65537, 65537, 65537, 786433, 786433, 5767169, 7340033, 23068673, 104857601, 167772161, 167772161, 167772161, 469762049, 2013265921, 3221225473, 3221225473
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Index entries for sequences related to primes in arithmetic progressions
|
|
EXAMPLE
|
a(10)=a(11)=12289 because 2^10x12+1 and 2^11x6+1 are equally the smallest primes in progressions with difference 1024 or 2048 resp.
|
|
MATHEMATICA
|
a = {}; Do[k = 0; While[ !PrimeQ[k 2^n + 1], k++ ]; AppendTo[a, k 2^n + 1], {n, 1, 50}]; a (*Artur Jasinski*)
|
|
CROSSREFS
|
Analogous case is A034694. Fermat primes (A000215) are a subset. See also Fermat numbers A000051.
Cf. A007522, A127575, A127576, A127577, A127578, A127580, A127581, A087522, A127586, A127587.
Sequence in context: A105408 A085418 A139427 this_sequence A040129 A045415 A045416
Adjacent sequences: A035086 A035087 A035088 this_sequence A035090 A035091 A035092
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu)
|
|
|
Search completed in 0.002 seconds
|
