|
Search: id:A164313
|
|
|
| A164313 |
|
LCM of all differences of odd primes up to prime(n). |
|
+0
1
|
|
| 2, 4, 24, 120, 840, 1680, 5040, 720720, 720720, 24504480, 465585120, 465585120, 465585120, 53542288800, 160626866400, 4658179125600, 288807105787200, 288807105787200, 288807105787200, 10685862914126400, 10685862914126400
(list; graph; listen)
|
|
|
OFFSET
|
3,1
|
|
|
COMMENT
|
That is, we compute the LCM of all differences prime(i)-prime(j) for 1 < j < i <= n.
|
|
REFERENCES
|
P. Erdos: Some problems on number theory, Analytic and elementary number theory (Marseille, 1983), Publ. Math. Orsay, 86-1, pp. 53-67, Univ. Paris XI, Orsay, 1986.
P. Erdos: Some problems on number theory, Proceedings of the seventeenth Southeastern international conference on combinatorics, graph theory, and computing (Boca Raton, Fla., 1986 Congr. Numer. 54 (1986), 225-244.
|
|
MATHEMATICA
|
Table[p=Prime[Range[2, n]]; d=Rest[Union[Abs[Flatten[Outer[Plus, p, -p]]]]]; LCM@@d, {n, 3, 30}]
|
|
CROSSREFS
|
Sequence in context: A163896 A068506 A119036 this_sequence A087981 A002875 A110491
Adjacent sequences: A164310 A164311 A164312 this_sequence A164314 A164315 A164316
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Aug 12 2009
|
|
|
Search completed in 0.002 seconds
|
