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 A232380 #6 Jul 23 2025 07:22:50 %S A232380 1,934,36574,957232,27133338,825606450,24945468636,747913169216, %T A232380 22460676406974,675143834470462,20291549259837168,609804313253059260, %U A232380 18326215546732616794,550758040677362295570,16551923665278410826856 %N A232380 Number of 5Xn 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, diagonally or antidiagonally, and no adjacent values equal. %C A232380 Row 5 of A232376 %H A232380 R. H. Hardin, <a href="/A232380/b232380.txt">Table of n, a(n) for n = 1..210</a> %e A232380 Some solutions for n=3 %e A232380 ..2..1..0....1..2..3....1..2..1....2..3..2....0..3..0....0..1..2....0..1..0 %e A232380 ..0..3..2....3..0..3....3..2..3....2..1..2....2..1..0....2..3..2....0..3..2 %e A232380 ..0..1..0....1..0..3....3..0..3....3..0..3....0..3..2....2..1..0....2..3..0 %e A232380 ..0..3..0....1..2..3....1..0..3....1..0..1....0..1..0....2..3..2....2..1..2 %e A232380 ..2..3..2....1..0..1....1..2..3....1..2..3....2..3..0....0..1..2....0..3..2 %K A232380 nonn %O A232380 1,2 %A A232380 _R. H. Hardin_, Nov 23 2013