|
Search: id:A129781
|
|
|
| A129781 |
|
The prime(n)-th upper twin prime. |
|
+0
1
|
|
| 7, 13, 31, 61, 139, 181, 241, 283, 433, 643, 811, 1033, 1153, 1279, 1429, 1669, 1933, 1999, 2143, 2341, 2551, 2791, 3121, 3361, 3583, 3853, 3931, 4093, 4159, 4261, 5011, 5281, 5641, 5659, 6361, 6553, 6781, 7129, 7351, 7759, 8233, 8389, 9013, 9241, 9433
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
Prime(n) = the n-th prime number.
|
|
EXAMPLE
|
The first prime is 2. The 2nd upper twin prime is 7, which gives the first entry.
|
|
PROGRAM
|
(PARI) g(n) = for(x=1, n, y=twinu(prime(x)); print1(y", ")) twinu(n) = { local(c, x); c=0; x=1; while(c<n, if(isprime(prime(x)+2), c++); x++; ); return(prime(x)) }
|
|
CROSSREFS
|
Sequence in context: A091431 A060800 A107146 this_sequence A040061 A091432 A102002
Adjacent sequences: A129778 A129779 A129780 this_sequence A129782 A129783 A129784
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)hotmail.com), May 17 2007
|
|
|
Search completed in 0.002 seconds
|
