|
| |
|
|
A062723
|
|
Least common multiple (lcm) of the first n+1 terms of A000792.
|
|
3
| |
|
|
1, 1, 2, 6, 12, 12, 36, 36, 36, 108, 108, 108, 324, 324, 324, 972, 972, 972, 2916, 2916, 2916, 8748, 8748, 8748, 26244, 26244, 26244, 78732, 78732, 78732, 236196, 236196, 236196, 708588, 708588, 708588, 2125764, 2125764, 2125764, 6377292, 6377292
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Apparently this sequence (when taken without repeats) is a subsequence of A000792, cf. A202337.
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=0,...,400
Index entries for sequences related to lcm's
|
|
|
FORMULA
| a(n) = 4*3^floor(n/3), n >= 3. - Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 18 2001
G.f.: (1+x+2*x^2+3*x^3+9*x^4+6*x^5+18*x^6)/(1-3*x^3).
|
|
|
EXAMPLE
| a(4)=12 beacuse a(4) is the lcm of 1,1,2,3,4 - which is clearly 12.
|
|
|
PROG
| (PARI) a(n)=if(n<0, 0, if(n<4, n!, 4*3^(n\3)))
(PARI) { for (n=0, 400, if (n<4, a=n!, a=4*3^(n\3)); write("b062723.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 09 2009]
(Haskell)
a062723 n = a062723_list !! n
a062723_list = scanl1 lcm a000792_list
-- Reinhard Zumkeller, Dec 17 2011
|
|
|
CROSSREFS
| Cf. A000244, A000792.
Sequence in context: A058198 A096075 A066791 * A152667 A145892 A154712
Adjacent sequences: A062720 A062721 A062722 * A062724 A062725 A062726
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Felix Goldberg (felixg(AT)tx.technion.ac.il), Jul 15 2001
|
|
|
EXTENSIONS
| Formula and correction from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 18 2001
More terms from Jason Earls (zevi_35711(AT)yahoo.com), Jul 21 2001
|
| |
|
|
