|
Search: id:A131940
|
|
|
| A131940 |
|
Least common multiple of {1, 7, 13, 19, 25, ..., (6n+1)} (A016921). |
|
+0
1
|
|
| 1, 7, 91, 1729, 43225, 1339975, 49579075, 2131900225, 14923301575, 164156317325, 10013535356825, 670906868907275, 48976201430231075, 3869119912988254925, 65775038520800333725, 65775038520800333725, 6380178736517632371325
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
This is to 6n+1 (A016921) as A051539 is to 4n+1 (A016813). Because 6*9 + 1 = 49 is divisible by 6*1 + 1 = 7, this sequence differs from A008542. a(n) | A008542(n+1).
|
|
MATHEMATICA
|
a = {1}; Do[l = 1; For[j = 1, j < n, j++, l = LCM[l, 6*j + 1]]; AppendTo[a, l], {n, 2, 20}]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 07 2007
|
|
CROSSREFS
|
Cf. A008542, A016813, A016921, A051539.
Sequence in context: A130978 A133307 A113372 this_sequence A008542 A121940 A124557
Adjacent sequences: A131937 A131938 A131939 this_sequence A131941 A131942 A131943
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost2(AT)yahoo.com), Oct 05 2007
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 07 2007
|
|
|
Search completed in 0.002 seconds
|
