cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A243211 Triangle T(n, k) = Numbers of ways to place k points on a triangular grid of side n so that no three of them are vertices of an equilateral triangle with sides parallel to the grid. Triangle read by rows.

Original entry on oeis.org

1, 1, 1, 3, 3, 1, 6, 15, 15, 3, 1, 10, 45, 107, 128, 63, 10, 1, 15, 105, 428, 1062, 1566, 1276, 507, 69, 1, 21, 210, 1282, 5160, 13971, 25191, 29235, 20508, 7747, 1251, 42, 1, 1, 28, 378, 3198, 18591, 77124, 231090, 498097, 759117, 792942, 540361, 222597, 49053
Offset: 1

Views

Author

Heinrich Ludwig, Jun 09 2014

Keywords

Comments

The triangle T(n, k) is irregularly shaped: 0 <= k <= A227308(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 three of them form an equilateral triangle with sides parallel to the grid is given by A227308(n).

Examples

			The triangle begins:
  1,  1;
  1,  3,   3;
  1,  6,  15,   15,    3;
  1, 10,  45,  107,  128,    63,    10,
  1, 15, 105,  428, 1062,  1566,  1276,   507,    69,
  1, 21, 210, 1282, 5160, 13971, 25191, 29235, 20508, 7747, 1251, 42, 1;
  ...
There is T(6, 12) = 1 way to place 12 points (x) on the grid obeying the rule in the definition of the sequence:
           .
          x x
         x . x
        x . . x
       x . . . x
      . x x x x .
		

Crossrefs

Cf. A227308, A243207, A084546, A234251, A239567, A240439, A194136, A000217 (column 2), A050534 (column 3), A243212 (column 4), A243213 (column 5), A243214 (column 6).

A234247 Triangle T(n,k) read by rows: Number of non-equivalent ways (mod D_3) to choose k points from an nXnXn triangular grid so that no three of them form a 2X2X2 subtriangle.

Original entry on oeis.org

1, 1, 1, 2, 4, 4, 2, 3, 10, 22, 31, 22, 10, 1, 4, 22, 82, 212, 374, 450, 342, 156, 36, 2, 5, 41, 231, 955, 2880, 6459, 10660, 12948, 11274, 6802, 2645, 595, 57, 2, 7, 72, 566, 3335, 14883, 51470, 139224, 297048, 500147, 661796, 681101, 536322, 314753, 132490
Offset: 1

Views

Author

Heinrich Ludwig, Feb 11 2014

Keywords

Comments

n starts from 1. The maximal number of points that can be chosen from a grid of side n, so that no three of them are forming a subtriangle of side 2, is A007980(n - 1). So k ranges from 1 to A007980(n - 1).
Column #1 (k = 1) is A001399.
Column #2 (k = 2) is A227327.
Without the restriction "non-equivalent (mod D_3)" numbers are given by A234251.

Examples

			Triangle begins
1;
1,  1;
2,  4,   4,   2;
3, 10,  22,  31,   22,   10,     1;
4, 22,  82, 212,  374,  450,   342,   156,    36,    2;
5, 41, 231, 955, 2880, 6459, 10660, 12948, 11274, 6802, 2645, 595, 57, 2;
...
There are exactly T(5, 10) = 2 non-equivalent ways to choose 10 points (X) from a triangular grid of side 5 avoiding that any three of them form a subtriangle of side 2.
       .                X
      X X              . X
     X . X            X . X
    . X X .          . X X .
   X X . X X        X X . X X
		

Crossrefs

A237529 Number of ways to choose 4 points in an n X n X n triangular grid so that no 3 of them form a 2 X 2 X 2 subtriangle.

Original entry on oeis.org

6, 156, 1191, 5565, 19620, 57351, 146391, 336951, 714555, 1417515, 2660196, 4763226, 8191911, 13604220, 21909810, 34341666, 52542036, 78664446, 115493685, 166585755, 236429886, 330634821, 456141681, 621465825, 836970225, 1115172981, 1471091706, 1922627616
Offset: 3

Views

Author

Heinrich Ludwig, Feb 09 2014

Keywords

Comments

All elements of the sequence are multiples of 3.

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{9,-36,84,-126,126,-84,36,-9,1},{6,156,1191,5565,19620,57351,146391,336951,714555},40] (* Harvey P. Dale, Sep 29 2019 *)
  • PARI
    Vec(-3*x^3*(2*x^6-11*x^5+21*x^4-14*x^3+x^2+34*x+2)/(x-1)^9 + O(x^100)) \\ Colin Barker, Feb 09 2014

Formula

a(n) = (n-1)*(n-2)*(n^6 + 7*n^5 + 13*n^4 - 7*n^3 - 230*n^2 - 408*n + 1152)/384.
G.f.: -3*x^3*(2*x^6 - 11*x^5 + 21*x^4 - 14*x^3 + x^2 + 34*x + 2) / (x-1)^9. - Colin Barker, Feb 09 2014
Showing 1-3 of 3 results.