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.

A233727 Number of (n+1)X(2+1) 0..3 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 6 and no adjacent elements equal.

This page as a plain text file.
%I A233727 #6 Jul 23 2025 08:10:18
%S A233727 148,756,3972,21432,115972,631628,3435216,18733728,102007004,
%T A233727 556289404,3030290308,16522951748,90024199928,490800907380,
%U A233727 2674421936852,14579265732508,79450066179340,433084651112312,2360226967287744
%N A233727 Number of (n+1)X(2+1) 0..3 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 6 and no adjacent elements equal.
%C A233727 Column 2 of A233733
%H A233727 R. H. Hardin, <a href="/A233727/b233727.txt">Table of n, a(n) for n = 1..210</a>
%F A233727 Empirical: a(n) = 3*a(n-1) +30*a(n-2) -71*a(n-3) -192*a(n-4) +415*a(n-5) +410*a(n-6) -847*a(n-7) -269*a(n-8) +544*a(n-9) +38*a(n-10) -42*a(n-11) -4*a(n-12)
%e A233727 Some solutions for n=5
%e A233727 ..0..2..0....1..2..0....1..0..1....3..2..3....1..0..2....1..2..3....3..2..0
%e A233727 ..1..0..1....2..0..1....3..2..0....2..0..1....3..1..3....3..1..0....1..3..1
%e A233727 ..3..1..3....3..2..3....2..0..1....3..2..3....1..0..1....2..0..2....3..2..3
%e A233727 ..2..0..1....1..0..1....0..1..3....0..1..0....2..3..2....3..1..0....2..0..1
%e A233727 ..1..2..0....2..3..2....2..0..2....1..3..1....3..1..3....2..0..2....3..2..0
%e A233727 ..2..0..1....3..1..3....3..2..3....0..1..2....1..0..1....3..1..0....1..0..1
%K A233727 nonn
%O A233727 1,1
%A A233727 _R. H. Hardin_, Dec 15 2013