|
Search: id:A110027
|
|
|
| A110027 |
|
Smallest prime starting (through <*2+1> or <*2-1>) a complete four iterations Cunningham chain of the first or second kind, and not coming themselves from such an iteration. |
|
+0
4
|
|
| 2, 1531, 6841, 15391, 44371, 53639, 53849, 57991, 61409, 66749, 83431, 105871, 143609, 145021, 150151, 167729
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The word "complete" indicates each chain is exactly 5 primes long (i.e. the chain cannot be a subchain of another one).
|
|
LINKS
|
Chris Caldwell's Prime Glossary, Cunningham chains.
|
|
EXAMPLE
|
2 is here because through <2p+1>, 2 -> 5 -> 11 -> 23 -> 47 and the chain ends here (with this operator).
1531 is here because through <2p-1>, 1531 -> 3061 -> 6121 -> 12241 -> 24481 and the chain ends here (with this operator).
|
|
MAPLE
|
Terms computed by Gilles Sadowski
|
|
CROSSREFS
|
Cf. A023272, A023302, A023330, A005384, A005385, A059452, A059455, A007700, Cf. A059759, A059760, A059761, A059762, A059763, A059764, A059765, A038397, A104349, A091314, A069362, A016093, A014937, A057326.
Sequence in context: A135129 A023291 A058423 this_sequence A062585 A002490 A129061
Adjacent sequences: A110024 A110025 A110026 this_sequence A110028 A110029 A110030
|
|
KEYWORD
|
easy,nonn,uned
|
|
AUTHOR
|
Alexandre Wajnberg (alexandre.wajnberg(AT)ulb.ac.be), Sep 03 2005
|
|
|
Search completed in 0.003 seconds
|
