|
|
A180402
|
|
a(n) = lcm(1,...,Fibonacci(n)).
|
|
2
|
|
|
1, 1, 2, 6, 60, 840, 360360, 232792560, 144403552893600, 164249358725037825439200, 718766754945489455304472257065075294400, 33312720618553145840562713089120360606823375590405920630576000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Also least period for number of ways of placing k non-attacking queens on an n X n chessboard. [conjectured by Kotesovec; proved for n <= 5. - Thomas Zaslavsky, Jun 24 2018]
|
|
LINKS
|
|
|
MAPLE
|
a:= n-> ilcm($1..(<<0|1>, <1|1>>^n)[1, 2]):
|
|
MATHEMATICA
|
Table[Apply[LCM, Range[Fibonacci[k]]], {k, 1, 10}]
|
|
PROG
|
(PARI) a(n) = lcm([1..fibonacci(n)]); \\ Michel Marcus, Jun 24 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|