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.

A232595 Number of (6+1)X(n+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or antidiagonally, with no adjacent elements equal.

This page as a plain text file.
%I A232595 #6 Jul 23 2025 07:31:44
%S A232595 18,6232,882,266490,66950,12486510,5045772,589476500,321877590,
%T A232595 27860113632,19476278870,1317233935380,1119177564872,62306560807010,
%U A232595 62309765310546,2948573086902894,3389517867089962,139604376377561036
%N A232595 Number of (6+1)X(n+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or antidiagonally, with no adjacent elements equal.
%C A232595 Row 6 of A232589
%H A232595 R. H. Hardin, <a href="/A232595/b232595.txt">Table of n, a(n) for n = 1..210</a>
%e A232595 Some solutions for n=4
%e A232595 ..0..1..0..1..0....0..1..0..1..2....0..1..2..1..0....0..1..0..1..0
%e A232595 ..2..1..2..1..0....2..1..2..1..0....2..1..0..1..2....2..1..2..1..0
%e A232595 ..0..1..2..1..0....0..1..2..1..2....2..1..0..1..2....0..1..0..1..0
%e A232595 ..0..1..0..1..2....2..1..0..1..0....2..1..0..1..2....2..1..2..1..2
%e A232595 ..2..1..2..1..0....2..1..0..1..2....0..1..2..1..0....2..1..0..1..0
%e A232595 ..2..1..0..1..0....0..1..0..1..0....0..1..0..1..0....2..1..0..1..2
%e A232595 ..2..1..2..1..0....2..1..2..1..0....2..1..2..1..0....2..1..2..1..0
%K A232595 nonn
%O A232595 1,1
%A A232595 _R. H. Hardin_, Nov 26 2013