|
Search: id:A054735
|
|
|
| A054735 |
|
Sum of twin prime pairs. |
|
+0
13
|
|
| 8, 12, 24, 36, 60, 84, 120, 144, 204, 216, 276, 300, 360, 384, 396, 456, 480, 540, 564, 624, 696, 840, 864, 924, 1044, 1140, 1200, 1236, 1284, 1320, 1620, 1644, 1656, 1716, 1764, 2040, 2064, 2100, 2124, 2184, 2304, 2460, 2556, 2580, 2604, 2640, 2856, 2904
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
(p^q)+(q^p) calculated modulo pq, where (p,q) is the n-th twin prime pair. Example: (599^601)+(601^599) == 1200 mod (599*601). - Sam Alexander (amnalexander(AT)yahoo.com), Nov 14 2003
El'hakk makes the following claim (without any proof): (q^p)+(p^q) == 2cosh(q arctanh( sqrt( 1-((2/p)^2) ) )) + 2cosh(p arctanh( sqrt( 1-((2/q)^2) ) )) mod pq - Sam Alexander (amnalexander(AT)yahoo.com), Nov 14 2003
|
|
LINKS
|
El'hakk, Page of the time traveler
|
|
FORMULA
|
a(n) = 2*A014574(n-1) = 4*A040040(n-1) = A111046(n)/2.
|
|
EXAMPLE
|
a(3)=24 because the twin primes 11 and 13 add to 24.
|
|
MAPLE
|
ZL:=[]:for p from 1 to 1451 do if (isprime(p) and isprime(p+2)) then ZL:=[op(ZL), p+(p+2)]; fi; od; print(ZL); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 07 2007
|
|
MATHEMATICA
|
Select[Table[Prime[n] + 1, {n, 230}], PrimeQ[ # + 1] &] *2 - Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 12 2005
|
|
CROSSREFS
|
Cf. A001359, A006512, A014574, A040040, A111046.
Sequence in context: A072902 A105571 A088525 this_sequence A077566 A067677 A045523
Adjacent sequences: A054732 A054733 A054734 this_sequence A054736 A054737 A054738
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Apr 22 2000
|
|
EXTENSIONS
|
Additional comments from Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 16 2003
|
|
|
Search completed in 0.002 seconds
|
