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.
%I A216792 #8 Jul 22 2025 23:35:37 %S A216792 1,1,0,1,1,0,1,11,1,0,1,31,5318,1,0,1,40,2976610,22831676,1,0,1,41, %T A216792 151280046,39123956055580,915294166360,1,0,1,41,1780127826, %U A216792 724448862721697721,69275022816331822721697,348567447145791344,1,0,1,41 %N A216792 T(n,k)=Number of (k+1) colorings of a side-n hexagonal array with colors introduced in row major order. %C A216792 Table starts %C A216792 .1.1..................1.......................1..................1 %C A216792 .0.1.................11......................31.................40 %C A216792 .0.1...............5318.................2976610..........151280046 %C A216792 .0.1...........22831676..........39123956055580.724448862721697721 %C A216792 .0.1.......915294166360.69275022816331822721697 %C A216792 .0.1.348567447145791344 %C A216792 .0.1 %C A216792 .0 %C A216792 rows 1, 2, 3 final values are 1, 41, 36536972794 %H A216792 R. H. Hardin, <a href="/A216792/b216792.txt">Table of n, a(n) for n = 1..40</a> %e A216792 Some solutions for n=3 k=4 %e A216792 ......0.1.0..........0.1.0..........0.1.2..........0.1.0..........0.1.2 %e A216792 .....2.3.2.1........1.2.3.1........3.2.3.0........2.3.2.1........1.2.3.0 %e A216792 ....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 %e A216792 .....2.3.2.1........2.0.2.1........1.2.3.1........2.3.0.1........1.2.3.0 %e A216792 ......0.1.3..........1.3.0..........3.0.2..........0.1.2..........0.1.2 %K A216792 nonn,tabl %O A216792 1,8 %A A216792 _R. H. Hardin_ Sep 16 2012