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 A208048 #7 Jun 02 2025 07:42:51 %S A208048 41,512,7540,118096,1897888,30818432,502504448,8206614784, %T A208048 134107752704,2192020679040,35832132655104,585752326535168, %U A208048 9575474013944320,156533905282970624,2558923378953086464,41831786939400151040 %N A208048 Number of nX6 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any horizontal, vertical or antidiagonal neighbor (colorings ignoring permutations of colors). %C A208048 Column 6 of A208050 %H A208048 R. H. Hardin, <a href="/A208048/b208048.txt">Table of n, a(n) for n = 1..210</a> %F A208048 Empirical: a(n) = 40*a(n-1) -672*a(n-2) +7048*a(n-3) -53920*a(n-4) +315080*a(n-5) -1388592*a(n-6) +4290880*a(n-7) -7204704*a(n-8) -5415680*a(n-9) +63216624*a(n-10) -131003904*a(n-11) -9639424*a(n-12) +571912192*a(n-13) -1570279424*a(n-14) +4233822208*a(n-15) -11382816768*a(n-16) +22231908352*a(n-17) -31692161024*a(n-18) +37178310656*a(n-19) -34628173824*a(n-20) +17179869184*a(n-21) for n>22 %e A208048 Some solutions for n=4 %e A208048 ..0..1..2..0..2..3....0..1..2..0..1..3....0..1..2..1..3..0....0..1..2..3..0..1 %e A208048 ..3..0..1..3..0..2....2..0..1..2..0..1....3..0..3..2..1..3....3..0..1..2..3..2 %e A208048 ..1..2..0..2..3..0....3..2..3..1..2..3....1..2..1..3..0..2....1..2..0..1..0..3 %e A208048 ..3..1..3..0..1..2....1..0..2..3..0..1....3..0..2..1..3..1....3..1..2..3..1..0 %K A208048 nonn %O A208048 1,1 %A A208048 _R. H. Hardin_ Feb 22 2012