|
| |
|
|
A067048
|
|
LCM(n,n+1,n+2,n+3,n+4)/60.
|
|
3
| |
|
|
1, 1, 7, 14, 42, 42, 462, 66, 429, 1001, 1001, 364, 6188, 1428, 3876, 3876, 6783, 4389, 33649, 3542, 17710, 32890, 26910, 8190, 118755, 23751, 56637, 50344, 79112, 46376, 324632, 31416, 145299, 250971, 191919, 54834, 749398, 141778
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
REFERENCES
| Amarnath Murthy, Some Notions on Least Common Multiples, Smarandache Notions Journal, Vol. 12, No. 1-2-3,Spring 2001.
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
M. L. Perez et al., eds., Smarandache Notions Journal
|
|
|
FORMULA
| From Gary Detlefs (gdetlefs(AT)aol.com) Apr 14 2011 and Apr 18 2011: (Start)
a(n)= (n+4)!*gcd(n-1,3)/(360*(n-1)!*gcd(n,4))
a(n)= (n+4)!*(5-4*cos((2*n+1)*Pi/3))/(1080*(n-1)!*(2+(-1)^n+cos(n*Pi/2)))
a(n)=(n+4)!*gcd(n-1,6)/(180*(n-1)!*2^((2*cos(n*Pi/2)+9+(-1)^n)/4)), n>1. (End)
|
|
|
EXAMPLE
| a(6) = 42 as LCM(6,7,8,9,10)/60 = 2520/60 = 42.
|
|
|
PROG
| (PARI) { for (n=1, 1000, write("b067048.txt", n, " ", lcm(lcm(lcm(n, n+1), lcm(n+2, n+3)), n+4)/60) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), May 01 2010]
|
|
|
CROSSREFS
| Cf. A067046, A067047.
Sequence in context: A084382 A055780 A161814 * A189046 A098328 A062098
Adjacent sequences: A067045 A067046 A067047 * A067049 A067050 A067051
|
|
|
KEYWORD
| nonn,easy,less
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 30 2001
|
| |
|
|
