A239570 -id:A239570 - cp's OEIS frontend

A239567 Triangle T(n, k) = Numbers of ways to place k points on a triangular grid of side n so that no two of them are adjacent. Triangle read by rows.

1, 3, 6, 6, 1, 10, 27, 21, 1, 15, 75, 151, 114, 27, 1, 21, 165, 615, 1137, 999, 353, 27, 28, 315, 1845, 6100, 11565, 12231, 6715, 1686, 150, 2, 36, 546, 4571, 23265, 74811, 153194, 196899, 153072, 67229, 14727, 1257, 28, 45, 882, 9926, 71211, 342042, 1124820

Offset: 1

Heinrich Ludwig, Mar 21 2014

The triangle T(n, k) is irregularly shaped: 1 <= k <= A239438(n). First row corresponds to n = 1.
The maximal number of points that can be placed on a triangular grid of side n so that no two of them are adjacent is given by A239438(n).
Row n is the coefficients of the independence polynomial of the triangular grid graph, omitting x^0 coefficients. - Eric W. Weisstein, Nov 11 2016

			Triangle begins:
   1;
   3;
   6,   6,    1;
  10,  27,   21,    1;
  15,  75,  151,  114,    27,     1;
  21, 165,  615, 1137,   999,   353,   27;
  28, 315, 1845, 6100, 11565, 12231, 6715, 1686, 150, 2;
...
There is T(10, 19) = 1 way to place 19 points (X) on a grid of side 10 under to the condition mentioned above:
               X
              . .
             . X .
            X . . X
           . . X . .
          . X . . X .
         X . . X . . X
        . . X . . X . .
       . X . . X . . X .
      X . . X . . X . . X
This pattern seems to be the densest packing for all n == 1 (mod 3) and n >= 10.
From _Eric W. Weisstein_, Nov 11 2016: (Start)
Independence polynomials of the n-triangular grid graphs for n = 1, 2, ...:
1 + 3*x,
1 + 6*x + 6*x^2 + x^3,
1 + 10*x + 27*x^2 + 21*x^3 + x^4,
1 + 15*x + 75*x^2 + 151*x^3 + 114*x^4 + 27*x^5 + x^6,
...
(End)

Heinrich Ludwig, Table of n, a(n) for n = 1..136
Stan Wagon, Graph Theory Problems from Hexagonal and Traditional Chess, The College Mathematics Journal, Vol. 45, No. 4, September 2014, pp. 278-287
Eric Weisstein's World of Mathematics, Independence Polynomial
Eric Weisstein's World of Mathematics, Triangular Grid Graph

Cf. A239438, A239572,
Column 1 is A000217,
Column 2 is A239568,
Column 3 is A239569,
Column 4 is A239570,
Column 5 is A239571,
Column 6 is A282998.
Row sums are A027740(n)-1.

A239568 Number of ways to place 2 points on a triangular grid of side n so that they are not adjacent.

Original entry on oeis.org

0, 6, 27, 75, 165, 315, 546, 882, 1350, 1980, 2805, 3861, 5187, 6825, 8820, 11220, 14076, 17442, 21375, 25935, 31185, 37191, 44022, 51750, 60450, 70200, 81081, 93177, 106575, 121365, 137640, 155496, 175032, 196350, 219555, 244755, 272061, 301587, 333450, 367770

Offset: 2

Heinrich Ludwig, Mar 22 2014

Heinrich Ludwig, Table of n, a(n) for n = 2..1000
M. J. Hay, J. Schiff, N. J. Fisch, Maximal energy extraction under discrete diffusive exchange, arXiv preprint arXiv:1508.03499, 2015
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1)

Cf. A239567, A032091, A239569 (3 points), A239570 (4 points), A239571 (5 points), A282998 (6 points).

Regarding the third formula, see similar sequences listed in A241765.

concat(0, Vec(3*x^3*(x-2)/(x-1)^5 + O(x^100))) \\ Colin Barker, Mar 22 2014

a(n) = n*(n-1)*(n-2)*(n+5)/8.
G.f.: 3*x^3*(x-2) / (x-1)^5. - Colin Barker, Mar 22 2014
a(n) = Sum_{i=0..n} (i+5)*A000217(i). - Bruno Berselli, Apr 29 2014
a(n) = t(t(n,k),n) + n, where t(n,k) = n*(n+1)/2 + k*n and t(n,1) = A000096(n). - Bruno Berselli, Feb 28 2017

A239569 Number of ways to place 3 points on a triangular grid of side n so that no two of them are adjacent.

Original entry on oeis.org

0, 1, 21, 151, 615, 1845, 4571, 9926, 19566, 35805, 61765, 101541, 160381, 244881, 363195, 525260, 743036, 1030761, 1405221, 1886035, 2495955, 3261181, 4211691, 5381586, 6809450, 8538725, 10618101, 13101921, 16050601, 19531065, 23617195, 28390296, 33939576

Offset: 2

Heinrich Ludwig, Mar 22 2014

Rotations and reflections of placements are counted. If they are to be ignored, see A239573.

Vincenzo Librandi, Table of n, a(n) for n = 2..1000
Index entries for linear recurrences with constant coefficients, signature (7,-21,35,-35,21,-7,1)

Cf. A239567, A239573, A239568 (2 points), A239570 (4 points), A239571 (5 points), A282998 (6 points).

[(n^2-3*n+2)*(n^4+6*n^3-23*n^2-92*n+264)/48: n in [2..40]]; // Vincenzo Librandi, Mar 23 2014

CoefficientList[Series[- x (11 x^4 - 36 x^3 + 25 x^2 + 14 x + 1)/(x - 1)^7, {x, 0, 40}], x] (* Vincenzo Librandi, Mar 23 2014 *)
LinearRecurrence[{7,-21,35,-35,21,-7,1},{0,1,21,151,615,1845,4571},50] (* Harvey P. Dale, Aug 08 2023 *)

concat(0, Vec(-x^3*(11*x^4-36*x^3+25*x^2+14*x+1)/(x-1)^7 + O(x^100))) \\ Colin Barker, Mar 22 2014

a(n) = (n-1)*(n-2)*(n^4+6*n^3-23*n^2-92*n+264)/48.

G.f.: -x^3*(11*x^4-36*x^3+25*x^2+14*x+1) / (x-1)^7. - Colin Barker, Mar 22 2014

A239571 Number of ways to place 5 points on a triangular grid of side n so that no two of them are adjacent.

Original entry on oeis.org

0, 0, 27, 999, 11565, 74811, 342042, 1239525, 3799488, 10259640, 25076952, 56552364, 119324403, 238062357, 452774595, 826245798, 1454229216, 2479147536, 4108199481, 6636929805, 10479498849, 16207085223, 24596072424, 36687908235, 53862785520, 77929575480

Offset: 3

Heinrich Ludwig, Mar 22 2014

Rotations and reflections of placements are counted. If they are to be ignored see A239575.

Vincenzo Librandi, Table of n, a(n) for n = 3..1000
Index entries for linear recurrences with constant coefficients, signature (11,-55,165,-330,462,-462,330,-165,55,-11,1)

Cf. A239567, A239575, A239568 (2 points), A239569 (3 points), A239570 (4 points), A282998 (6 points).

[(n^2-7*n+12)*(n^8+12*n^7-58*n^6-860*n^5+2141*n^4 +23728*n^3-61316*n^2-244928*n+770880)/3840: n in [3..40]]; // Vincenzo Librandi, Mar 23 2014

CoefficientList[Series[- 3 x^2 (40 x^8 - 185 x^7 + 198 x^6 + 213 x^5 - 243 x^4 - 638 x^3 + 687 x^2 + 234 x + 9)/(x - 1)^11, {x, 0, 40}], x] (* Vincenzo Librandi, Mar 23 2014 *)

concat([0,0], Vec(-3*x^5*(40*x^8-185*x^7+198*x^6+213*x^5-243*x^4-638*x^3+687*x^2+234*x+9)/(x-1)^11 + O(x^100))) \\ Colin Barker, Mar 22 2014

a(n) = (n -3) * (n -4) * (n^8 +12*n^7 -58*n^6 -860*n^5 +2141*n^4 +23728*n^3 -61316*n^2 -244928*n +770880)/3840.

G.f.: -3*x^5*(40*x^8-185*x^7+198*x^6+213*x^5-243*x^4-638*x^3+687*x^2+234*x+9) / (x-1)^11. - Colin Barker, Mar 22 2014

A282998 Number of ways to place 6 points on a triangular grid of side n so that no two of them are adjacent.

Original entry on oeis.org

0, 0, 1, 353, 12231, 153194, 1124820, 5893221, 24425212, 85152341, 259805430, 712840480, 1793423456, 4197531636, 9240962666, 19301854131, 38514786780, 73828909906, 136581190475, 244784427831, 426389859697, 723857976770, 1200460734396, 1948846090829, 3102524331336

Offset: 3

Heinrich Ludwig, Feb 26 2017

Rotations and reflections of placements are counted. If they are to be ignored, see A279446.

			There is a(5) = 1 way to place 6 points on a triangular grid of side n = 5:
        X
       . .
      X . X
     . . . .
    X . X . X

Heinrich Ludwig, Table of n, a(n) for n = 3..1000
Index entries for linear recurrences with constant coefficients, signature (13,-78,286,-715,1287,-1716,1716,-1287,715,-286,78,-13,1).

Cf. A279446, A239567, A239568 (2 points), A239569 (3 points), A239570 (4 points), A239571 (5 points).

A282998:=n->(n^12 + 6*n^11 - 195*n^10 - 670*n^9 + 17455*n^8 + 13426*n^7 - 836249*n^6 + 1252990*n^5 + 19599884*n^4 - 68542552*n^3 - 131400416*n^2 + 974223360*n - 1308856320)/46080: 0,seq(A282998(n), n=4..30); # Wesley Ivan Hurt, Apr 10 2017

Drop[CoefficientList[Series[(x^5 * (1 + 340 * x + 7720 * x^2 + 21439 * x^3 - 12927 * x^4 - 27265 * x^5 + 28385 * x^6 - 6252 * x^7 - 116 * x^8 - 2365 * x^9 + 1787 * x^10 - 352 * x^11) / (1 - x)^13 ),{x,0,27}],x],3] (* Indranil Ghosh, Feb 26 2017, from the g.f. by Colin Barker *)

concat(vector(2), Vec(x^5*(1 + 340*x + 7720*x^2 + 21439*x^3 - 12927*x^4 - 27265*x^5 + 28385*x^6 - 6252*x^7 - 116*x^8 - 2365*x^9 + 1787*x^10 - 352*x^11) / (1 - x)^13 + O(x^30))) \\ Colin Barker, Feb 26 2017

a(n) = (n^12 + 6*n^11 - 195*n^10 - 670*n^9 + 17455*n^8 + 13426*n^7 - 836249*n^6 + 1252990*n^5 + 19599884*n^4 - 68542552*n^3 - 131400416*n^2 + 974223360*n - 1308856320)/46080 for n>=4.

G.f.: x^5*(1 + 340*x + 7720*x^2 + 21439*x^3 - 12927*x^4 - 27265*x^5 + 28385*x^6 - 6252*x^7 - 116*x^8 - 2365*x^9 + 1787*x^10 - 352*x^11) / (1 - x)^13. - Colin Barker, Feb 26 2017

A239574 Number of non-equivalent (mod D_3) ways to place 4 indistinguishable points on a triangular grid of side n so that no two of them are adjacent.

Original entry on oeis.org

0, 1, 24, 200, 1053, 3932, 11988, 31298, 73046, 155880, 310046, 581414, 1038634, 1779531, 2942114, 4714412, 7350595, 11184786, 16654116, 24317554, 34886940, 49252544, 68523846, 94062350, 127534794, 170954603, 226748678, 297809946, 387580007, 500113190, 640178710

Offset: 3

Heinrich Ludwig, Mar 23 2014

Rotations and reflections of placements are not counted. If they are to be counted see A239570.

			There is a(4) = 1 way to place 4 points on a triangular grid of side n = 4:
      X
     . .
    . X .
   X . . X

Heinrich Ludwig, Table of n, a(n) for n = 3..1000
Index entries for linear recurrences with constant coefficients, signature (2,3,-5,-8,3,19,4,-24,-15,15,24,-4,-19,-3,8,5,-3,-2,1)

Cf. A239572, A239570, A032091 (2 points), A239573 (3 points), A239575 (5 points), A279446 (6 points).

Drop[CoefficientList[Series[x^4*(-1 - 22*x - 149*x^2 - 586*x^3 - 1354*x^4 - 2154*x^5 - 2300*x^6 - 1510*x^7 - 259*x^8 + 470*x^9 + 443*x^10 + 70*x^11 - 130*x^12 - 94*x^13 - 10*x^14 + 18*x^15 + 8*x^16) / ((-1+x)^9 * (1+x)^4 * (1+x+x^2)^3), {x, 0, 20}], x],3] (* Vaclav Kotesovec, Mar 29 2014 *)
Table[(n^8+4*n^7-78*n^6-104*n^5+2556*n^4-3152*n^3-27280*n^2+89664*n-78336)/2304 + If[Mod[n,2]==1,(28*n^3-54*n^2-160*n+129)/768,0] + If[Mod[n,3]==1,(n^2+n-14)/18,0],{n,3,20}] (* Vaclav Kotesovec after Heinrich Ludwig, Mar 29 2014 *)

a(n) = (n^8 +4*n^7 -78*n^6 -104*n^5 +2556*n^4 -3152*n^3 -27280*n^2 +89664*n -78336)/2304 +IF(n == 1 mod 2)*(28*n^3 -54*n^2 -160*n +129)/768 +IF(n == 1 mod 3)*(n^2 +n -14)/18.

G.f.: x^4*(-1 - 22*x - 149*x^2 - 586*x^3 - 1354*x^4 - 2154*x^5 - 2300*x^6 - 1510*x^7 - 259*x^8 + 470*x^9 + 443*x^10 + 70*x^11 - 130*x^12 - 94*x^13 - 10*x^14 + 18*x^15 + 8*x^16) / ((-1+x)^9 * (1+x)^4 * (1+x+x^2)^3). - Vaclav Kotesovec, Mar 29 2014

cp's OEIS Frontend

A239567 Triangle T(n, k) = Numbers of ways to place k points on a triangular grid of side n so that no two of them are adjacent. Triangle read by rows.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A239568 Number of ways to place 2 points on a triangular grid of side n so that they are not adjacent.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A239569 Number of ways to place 3 points on a triangular grid of side n so that no two of them are adjacent.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A239571 Number of ways to place 5 points on a triangular grid of side n so that no two of them are adjacent.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A282998 Number of ways to place 6 points on a triangular grid of side n so that no two of them are adjacent.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A239574 Number of non-equivalent (mod D_3) ways to place 4 indistinguishable points on a triangular grid of side n so that no two of them are adjacent.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula