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.

A241332 Number of 5Xn 0..3 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..3 introduced in row major order.

This page as a plain text file.
%I A241332 #6 Jul 23 2025 11:12:56
%S A241332 51,13011,3875244,1162535788,348722168314,104609549355169,
%T A241332 31380712101748979,9413573643641662509,2823880131958273083335,
%U A241332 847106463240283581573699,254114667346044108988181086
%N A241332 Number of 5Xn 0..3 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..3 introduced in row major order.
%C A241332 Row 5 of A241328
%H A241332 R. H. Hardin, <a href="/A241332/b241332.txt">Table of n, a(n) for n = 1..167</a>
%e A241332 Some solutions for n=2
%e A241332 ..0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1
%e A241332 ..1..2....0..2....0..2....2..3....2..3....0..0....1..0....0..2....2..0....2..3
%e A241332 ..0..3....1..3....2..2....0..3....1..0....2..0....2..0....1..0....2..1....1..3
%e A241332 ..0..2....3..1....2..0....2..1....1..2....2..3....2..0....2..0....1..3....0..1
%e A241332 ..0..3....2..0....1..2....1..0....2..1....2..3....3..0....3..1....1..2....1..0
%K A241332 nonn
%O A241332 1,1
%A A241332 _R. H. Hardin_, Apr 19 2014