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.

A233157 Number of 4 X n 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally or antidiagonally.

This page as a plain text file.
%I A233157 #8 Oct 09 2018 14:57:30
%S A233157 81,384,2592,17496,121176,842616,5871528,40931568,285366888,
%T A233157 1989557640,13871104848,96708780360,674249796360,4700843090928,
%U A233157 32774093555112,228499694410248,1593090904911120,11106967289377032,77437340197187976
%N A233157 Number of 4 X n 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally or antidiagonally.
%H A233157 R. H. Hardin, <a href="/A233157/b233157.txt">Table of n, a(n) for n = 1..210</a>
%F A233157 Empirical: a(n) = 9*a(n-1) - 15*a(n-2) + 6*a(n-3) for n>7.
%F A233157 Empirical g.f.: 3*x*(27 - 115*x + 117*x^2 - 186*x^3 + 96*x^4 - 360*x^5 + 216*x^6) / (1 - 9*x + 15*x^2 - 6*x^3). - _Colin Barker_, Oct 09 2018
%e A233157 Some solutions for n=5:
%e A233157 ..0..1..0..0..0....1..2..2..1..2....0..0..1..2..1....2..1..0..0..1
%e A233157 ..0..0..0..0..0....2..1..2..2..2....1..2..1..0..1....0..0..1..2..1
%e A233157 ..1..0..0..0..0....2..2..2..2..1....1..0..1..2..2....0..0..1..2..1
%e A233157 ..0..1..0..0..1....2..1..2..2..2....1..2..1..2..2....1..0..1..0..1
%Y A233157 Row 4 of A233155.
%K A233157 nonn
%O A233157 1,1
%A A233157 _R. H. Hardin_, Dec 05 2013