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 A224668 #7 Sep 02 2018 14:46:11 %S A224668 428,542,668,806,956,1118,1292,1478,1676,1886,2108,2342,2588,2846, %T A224668 3116,3398,3692,3998,4316,4646,4988,5342,5708,6086,6476,6878,7292, %U A224668 7718,8156,8606,9068,9542,10028,10526,11036,11558,12092,12638,13196,13766,14348 %N A224668 Number of 6 X 6 0..n matrices with each 2 X 2 subblock idempotent. %H A224668 R. H. Hardin, <a href="/A224668/b224668.txt">Table of n, a(n) for n = 1..210</a> %F A224668 Empirical: a(n) = 6*n^2 + 96*n + 326. %F A224668 Conjectures from _Colin Barker_, Sep 02 2018: (Start) %F A224668 G.f.: 2*x*(214 - 371*x + 163*x^2) / (1 - x)^3. %F A224668 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>3. %F A224668 (End) %e A224668 Some solutions for n=3: %e A224668 ..1..0..0..0..1..0....1..1..1..1..1..0....1..0..1..0..0..3....1..0..1..0..0..1 %e A224668 ..1..0..0..0..1..0....0..0..0..0..0..0....1..0..1..0..0..1....1..0..1..0..0..1 %e A224668 ..1..0..0..0..1..0....1..1..1..1..1..1....0..0..1..0..0..1....1..0..1..0..0..1 %e A224668 ..1..0..0..0..1..0....0..0..0..0..0..0....0..0..1..0..0..1....1..0..1..0..0..1 %e A224668 ..1..0..0..0..1..0....1..1..1..1..1..1....0..0..1..0..0..1....1..0..1..0..0..1 %e A224668 ..2..0..0..0..1..0....0..0..0..0..0..0....0..0..1..0..0..1....0..0..1..0..0..1 %Y A224668 Row 6 of A224665. %K A224668 nonn %O A224668 1,1 %A A224668 _R. H. Hardin_, Apr 14 2013