login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068635 Smaller of the first twin pair to yield a twin pair chain of length n. 1
3, 5, 211049, 253679, 41887255409, 73768891456259 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

PARI program written by Rick L. Shepherd.

If n is in the sequence and n>5 then Mod[n,30]=29. - Farideh Firoozbakht, Mar 26 2004

REFERENCES

a(3) and a(4) found by Rick L. Shepherd and Don Reble; a(5) by David W. Wilson; a(6) by Don Reble.

LINKS

Table of n, a(n) for n=1..6.

EXAMPLE

5,7 form a twin pair, separated by the number 6. Their sum 12 is the separator of another twin pair, 11,13. _Their_ sum is not the separator of a further twin pair. (5,7),(11,13) is a chain of length 2. 5 is the lower of the smallest twin pair to generate a chain of this length, so a(2)=5.

Here are the actual chains (lesser of twin primes given): 3; 5 -> 11; 211049 -> 422099 -> 844199; 253679 -> 507359 -> 1014719 -> 2029439; 41887255409 -> 83774510819 -> 167549021639 -> 335098043279 -> 670196086559; ...

PROG

(PARI) for(n=1, 40000, if(prime(n+1)-prime(n)==2, s=prime(n+1)+prime(n); if(isprime(s-1)&&isprime(s+1), if(isprime(2*s-1)&&isprime(2*s+1), print(n, ", ", prime(n))))))

CROSSREFS

Cf. A069142. Equals A069179 - 1.

Sequence in context: A333269 A319598 A126334 * A156695 A330251 A175645

Adjacent sequences:  A068632 A068633 A068634 * A068636 A068637 A068638

KEYWORD

nonn

AUTHOR

Neil Fernandez, Apr 10 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 11 05:30 EDT 2021. Contains 342886 sequences. (Running on oeis4.)