|
%I #35 Jun 25 2018 03:44:45
%S 1,1,2,6,60,840,360360,232792560,144403552893600,
%T 164249358725037825439200,718766754945489455304472257065075294400,
%U 33312720618553145840562713089120360606823375590405920630576000
%N a(n) = lcm(1,...,Fibonacci(n)).
%C 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]
%H Alois P. Heinz, <a href="/A180402/b180402.txt">Table of n, a(n) for n = 1..17</a>
%H Christopher R. H. Hanusa, T. Zaslavsky, S. Chaiken, <a href="http://arxiv.org/abs/1609.00853">A q-Queens Problem. IV. Queens, Bishops, Nightriders (and Rooks)</a>, arXiv preprint arXiv:1609.00853 [math.CO], 2016. See Table 8.1.
%H V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>, 6ed, p.31, 2013
%p a:= n-> ilcm($1..(<<0|1>, <1|1>>^n)[1,2]):
%p seq(a(n), n=1..14); # _Alois P. Heinz_, Aug 12 2017
%t Table[Apply[LCM, Range[Fibonacci[k]]], {k, 1, 10}]
%t Array[LCM @@ Range@Fibonacci@# &, 12] (* _Robert G. Wilson v_, Sep 05 2010 *)
%o (PARI) a(n) = lcm([1..fibonacci(n)]); \\ _Michel Marcus_, Jun 24 2018
%Y Cf. A178717, A178721, A078491, A218492, A035105, A062954.
%K nonn
%O 1,3
%A _Vaclav Kotesovec_, Sep 02 2010
%E a(11) onwards from _Robert G. Wilson v_, Sep 05 2010
|
