|
Search: id:A058255
|
|
|
| A058255 |
|
Distinct values of LCM { p(i)-1, i=1..n}, where p() are the primes. |
|
+0
3
|
|
| 1, 2, 4, 12, 60, 240, 720, 7920, 55440, 1275120, 16576560, 480720240, 19709529840, 39419059680, 197095298400, 3350620072800, 177582863858400, 532748591575200, 19711697888282400, 59135093664847200
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The prime A095365(n) is the least prime yielding an LCM of a(n). This sequence and A095365 are related to A095366. - T. D. Noe (noe(AT)sspectra.com), Jun 04 2004
|
|
EXAMPLE
|
For p = 29, 31, 37, 41, 43 these LCMs are equal to to 55440 = 11*7! = LCM[1, 2, 4, 6, 10, 12, 16, 22, 28, 30, 36, 40, 42] = LCM[1, 2, 4, 6, 10, 12, 16, 22, 28]. The values was put on the stage only once. Repetitions skipped.
|
|
CROSSREFS
|
A058254 with duplicates removed.
Cf. A002110, A005867, A003418, A054451, A000142, A000010.
Cf. A095366 (least k > 1 such that k divides 1^n + 2^n +...+ (k-1)^n).
Sequence in context: A128646 A058254 A076244 this_sequence A118456 A013202 A004400
Adjacent sequences: A058252 A058253 A058254 this_sequence A058256 A058257 A058258
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Dec 06 2000
|
|
|
Search completed in 0.002 seconds
|
