A296359
Number of monohedral disk tilings of type C^t_{2n+1,2}.
Original entry on oeis.org
62, 1532, 50830, 1855110, 71292624, 2833906726, 115381823442, 4782782748036, 201037496481198, 8545008347772070, 366526239773992472, 15841416797530328062, 689082764185943820494, 30139654907867753730956, 1324572400153686602854414, 58455392031254908270140098
Offset: 1
-
U[n_, k_] := DivisorSum[GCD[n, k], EulerPhi[#]*Binomial[(n+k)/#, n/#]/(n+k) &];
a[n_] := 2*Sum[U[i, 2*(4*n+2-i)], {i, 0, 4*n+2}];
Array[a, 16] (* Jean-François Alcover, Jun 14 2018, after Andrew Howroyd *)
-
\\ here U is A241926
U(n,k)={sumdiv(gcd(n,k), d, eulerphi(d)*binomial((n+k)/d, n/d)/(n+k))}
a(n)={2*sum(i=0, 4*n+2, U(i,2*(4*n+2-i)))} \\ Andrew Howroyd, Jan 09 2018
A296360
Number of monohedral disk tilings of type C^t_{2n+1,3}.
Original entry on oeis.org
116, 6402, 446930, 34121322, 2741227176, 227759341712, 19382568941318, 1679333068357460, 147541888215426742, 13107891004266127974, 1175188298096727647322, 106164291028322202227232, 9652457243380891557169712, 882443342536355491502025678
Offset: 1
-
U[n_, k_] := DivisorSum[GCD[n, k], EulerPhi[#]*Binomial[(n + k)/#, n/#]/(n + k) &];
a[n_] := 2*Sum[U[i, 3*(4*n + 2 - i)], {i, 0, 4*n + 2}];
Array[a, 16] (* Jean-François Alcover, Jun 14 2018, after Andrew Howroyd *)
-
\\ here U is A241926
U(n,k)={sumdiv(gcd(n,k), d, eulerphi(d)*binomial((n+k)/d, n/d)/(n+k))}
a(n)={2*sum(i=0, 4*n+2, U(i,3*(4*n+2-i)))} \\ Andrew Howroyd, Jan 09 2018
A296362
Number of monohedral disk tilings of type C^t_{5,n}.
Original entry on oeis.org
2, 1532, 6402, 19884, 51128, 115188, 235180, 445096, 792822, 1343814, 2185396, 3431466, 5227806, 7758398, 11251894, 15989150, 22311572, 30630012, 41434474, 55305224, 72924016, 95086728, 122717140, 156881256, 198802766, 249880274, 311704608, 386077910
Offset: 1
-
U[n_, k_] := DivisorSum[GCD[n, k], EulerPhi[#]*Binomial[(n+k)/#, n/#]/(n+k) &];
a[1] = 2; a[n_] := 2*Sum[ U[i, n*(10 - i)], {i, 0, 10}];
Array[a, 30] (* Jean-François Alcover, Jun 14 2018, after Andrew Howroyd *)
-
\\ here U is A241926
U(n,k)={sumdiv(gcd(n,k), d, eulerphi(d)*binomial((n+k)/d, n/d)/(n+k))}
a(n)={2*if(n<2, n==1, sum(i=0, 10, U(i,n*(10-i))))} \\ Andrew Howroyd, Jan 09 2018
Showing 1-3 of 3 results.