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.

A216792 T(n,k)=Number of (k+1) colorings of a side-n hexagonal array with colors introduced in row major order.

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 11, 1, 0, 1, 31, 5318, 1, 0, 1, 40, 2976610, 22831676, 1, 0, 1, 41, 151280046, 39123956055580, 915294166360, 1, 0, 1, 41, 1780127826, 724448862721697721, 69275022816331822721697, 348567447145791344, 1, 0, 1, 41
Offset: 1

Views

Author

R. H. Hardin Sep 16 2012

Keywords

Comments

Table starts
.1.1..................1.......................1..................1
.0.1.................11......................31.................40
.0.1...............5318.................2976610..........151280046
.0.1...........22831676..........39123956055580.724448862721697721
.0.1.......915294166360.69275022816331822721697
.0.1.348567447145791344
.0.1
.0
rows 1, 2, 3 final values are 1, 41, 36536972794

Examples

			Some solutions for n=3 k=4
......0.1.0..........0.1.0..........0.1.2..........0.1.0..........0.1.2
.....2.3.2.1........1.2.3.1........3.2.3.0........2.3.2.1........1.2.3.0
....1.0.1.3.0......0.3.1.0.3......2.0.1.2.3......1.0.1.3.0......3.0.1.2.3
.....2.3.2.1........2.0.2.1........1.2.3.1........2.3.0.1........1.2.3.0
......0.1.3..........1.3.0..........3.0.2..........0.1.2..........0.1.2