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.

A302219 Number of n X 3 0..1 arrays with every element equal to 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A302219 #6 Jan 20 2024 17:46:00
%S A302219 1,14,43,194,675,2666,9819,37382,140039,528962,1989787,7501790,
%T A302219 28252719,106464314,401084083,1511229542,5693728487,21452605794,
%U A302219 80826937611,304534567726,1147401249247,4323099142602,16288258059235,61369756239670
%N A302219 Number of n X 3 0..1 arrays with every element equal to 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A302219 Column 3 of A302224.
%H A302219 R. H. Hardin, <a href="/A302219/b302219.txt">Table of n, a(n) for n = 1..210</a>
%F A302219 Empirical: a(n) = 3*a(n-1) +7*a(n-2) -5*a(n-3) -34*a(n-4) -46*a(n-5) +64*a(n-6) +112*a(n-7) +60*a(n-8) -96*a(n-9) -80*a(n-10) -64*a(n-11).
%e A302219 Some solutions for n=5
%e A302219 ..0..0..0. .0..0..0. .0..0..0. .0..0..0. .0..0..0. .0..0..1. .0..0..0
%e A302219 ..1..1..0. .0..1..1. .1..1..0. .1..0..1. .1..1..1. .1..1..0. .0..1..1
%e A302219 ..1..0..0. .1..0..1. .0..0..1. .1..1..0. .0..0..1. .0..1..1. .1..0..1
%e A302219 ..1..0..0. .1..0..1. .0..1..1. .0..1..0. .1..0..0. .0..0..1. .1..0..0
%e A302219 ..1..1..1. .0..1..1. .0..0..1. .1..0..0. .1..1..0. .1..1..0. .1..1..0
%Y A302219 Cf. A302224.
%K A302219 nonn
%O A302219 1,2
%A A302219 _R. H. Hardin_, Apr 03 2018