|
Search: id:A095750
|
|
| |
|
| 0, 0, 1, 2, 3, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
This sequence is derived from the special case of Cunningham chains of the first kind where every member of the chain is a Sophie Germain prime.
This sequence can be obtained by subtracting 2 from A074313 and then deleting all negative members. - David Wasserman (dwasserm(AT)earthlink.net), Sep 13 2007
|
|
LINKS
|
C. K. Caldwell, Cunningham Chains.
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
EXAMPLE
|
Entries 0, 0, 1, 2, 3 correspond to the Sophie Germain primes 2, 3, 5, 11, 23. 5 is degree 1 because 5 = (2 * 2) + 1 and 2 is also a Sophie Germain prime. Similarly, 11 = (5 * 2) + 1, therefore 11 is degree 2. 23 = (11 * 2) + 1, thus 23 is degree 3 and so on.
|
|
CROSSREFS
|
Cf. A005384.
Sequence in context: A045830 A078771 A072771 this_sequence A056966 A037846 A037882
Adjacent sequences: A095747 A095748 A095749 this_sequence A095751 A095752 A095753
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Andrew Plewe (aplewe(AT)sbcglobal.net), Jul 09 2004
|
|
EXTENSIONS
|
More terms from David Wasserman (dwasserm(AT)earthlink.net), Sep 13 2007
|
|
|
Search completed in 0.002 seconds
|
