Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110038
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110038 Smallest prime beginning (through <*2+1>) or <*2-1>) a complete Cunningham chain (of the first or the second kind) of length n. +0
4
17, 29, 19, 509, 2, 89, 16651 (list; graph; listen)
OFFSET

1,1

COMMENT

The word "complete" indicates each chain is exactly n primes long (i.e. the chain cannot be a subchain of another one).

LINKS

Chris Caldwell's Prime Glossary, Cunningham chains.

EXAMPLE

a(2)=29 is here because through <2p+1>, 29->59 and the chain ends here (with this operator).

a(3)=19 is here because through <2p-1>, 19->37->73 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.

Adjacent sequences: A110035 A110036 A110037 this_sequence A110039 A110040 A110041

Sequence in context: A000797 A134468 A032611 this_sequence A081985 A087937 A103739

KEYWORD

easy,nonn,uned

AUTHOR

Alexandre Wajnberg (alexandre.wajnberg(AT)ulb.ac.be), Sep 03 2005

page 1

Search completed in 0.002 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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research