OFFSET
1,1
COMMENTS
Enumeration is equivalent to counting beaded necklaces of a certain class (see A047996). For details and definitions, see the arXiv preprint by Haddley and Worsley.
LINKS
Joel Haddley, Stephen Worsley, Infinite families of monohedral disk tilings, arXiv preprint arXiv:1512.03794v2 [math.MG], 2016.
FORMULA
A(1,n) = 2, A(k,n) = 2*Sum_{i=0..2*(2*n+1)}Sum_{d | i, d | (2*(2*n+1)-i)*k} (phi(d)/i)*binomial((2*(2*n+1)-i)*k/d+i/d-1, i/d-1), k >= 2, n >= 1 [Haddley, Worsley, Proposition 5.1].
EXAMPLE
Array begins:
. 2 2 2 2 2 2
. 62 1532 50830 1855110 71292624 2833906726
. 116 6402 446930 34121322 2741227176 227759341712
. 200 19884 2460462 332112068 47162138964 6926365932512
. 318 51128 10106370 2177193500 493416845604 115646287581042
. 476 115188 33905948 10874491594 3668999040616 1280224897307324
MATHEMATICA
a[1, n_] := 2; a[k_, n_] := 2*(1 + Sum[(1/i)*Sum[EulerPhi[d]*Binomial[(2*(2*n + 1) - i)*k/d + i/d - 1, i/d - 1], {d, Divisors[GCD[i, (2*(2*n + 1) - i)*k]]}], {i, 2*(2*n + 1)}]);
(* Array: *)
Grid[Table[a[k, n], {k, 6}, {n, 6}]]
(* Or array antidiagonals flattened: *)
Flatten[Table[a[k - n + 1, n], {k, 7}, {n, k}]]
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
L. Edson Jeffery, May 14 2016
STATUS
approved
