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.

A239156 Number of (3+1)X(n+1) 0..3 arrays with no element equal to all horizontal neighbors or unequal to all vertical neighbors, and new values 0..3 introduced in row major order.

This page as a plain text file.
%I A239156 #6 Jul 23 2025 10:57:53
%S A239156 7,55,868,12159,175471,2519488,36221263,520615791,7483320292,
%T A239156 107564015719,1546111034695,22223587182336,319438814614615,
%U A239156 4591569914960743,65998599449004004,948654862324898319
%N A239156 Number of (3+1)X(n+1) 0..3 arrays with no element equal to all horizontal neighbors or unequal to all vertical neighbors, and new values 0..3 introduced in row major order.
%C A239156 Row 3 of A239155
%H A239156 R. H. Hardin, <a href="/A239156/b239156.txt">Table of n, a(n) for n = 1..210</a>
%F A239156 Empirical: a(n) = 14*a(n-1) +14*a(n-2) -124*a(n-3) -6*a(n-4) +90*a(n-5) -27*a(n-6)
%e A239156 Some solutions for n=4
%e A239156 ..0..1..0..2..3....0..1..0..0..1....0..1..2..1..0....0..1..0..1..2
%e A239156 ..0..1..0..2..3....0..1..0..0..1....0..1..2..1..0....0..1..0..1..2
%e A239156 ..1..3..0..0..1....1..2..2..1..2....3..1..1..0..1....2..1..0..3..0
%e A239156 ..1..3..0..0..1....1..2..2..1..2....3..1..1..0..1....2..1..0..3..0
%K A239156 nonn
%O A239156 1,1
%A A239156 _R. H. Hardin_, Mar 11 2014