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.

A269294 Number of 6Xn 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three no more than once.

This page as a plain text file.
%I A269294 #4 Feb 21 2016 09:31:38
%S A269294 4096,3306744,1085203980,309846524148,81907569617580,
%T A269294 20680187784811380,5062027330721456172,1211690913720475660164,
%U A269294 285185178252679536489420,66240633180683878759737972,15223317892237120439440690380
%N A269294 Number of 6Xn 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three no more than once.
%C A269294 Row 6 of A269289.
%H A269294 R. H. Hardin, <a href="/A269294/b269294.txt">Table of n, a(n) for n = 1..210</a>
%H A269294 R. H. Hardin, <a href="/A269294/a269294.txt">Empirical recurrence of order 40</a>
%F A269294 Empirical recurrence of order 40 (see link above)
%e A269294 Some solutions for n=2
%e A269294 ..0..0. .0..0. .0..0. .0..0. .0..0. .0..0. .0..0. .0..0. .0..0. .0..0
%e A269294 ..2..3. .0..1. .2..3. .0..0. .2..0. .0..1. .2..2. .0..1. .1..0. .2..0
%e A269294 ..1..3. .2..0. .3..3. .1..1. .0..2. .1..0. .2..0. .3..3. .0..0. .0..1
%e A269294 ..0..1. .1..0. .3..1. .1..1. .2..3. .2..3. .1..2. .1..0. .1..0. .0..2
%e A269294 ..3..1. .0..0. .1..0. .3..3. .1..3. .3..2. .3..2. .1..0. .0..0. .0..2
%e A269294 ..0..1. .2..3. .2..0. .0..1. .3..1. .0..1. .0..1. .2..2. .1..2. .2..3
%Y A269294 Cf. A269289.
%K A269294 nonn
%O A269294 1,1
%A A269294 _R. H. Hardin_, Feb 21 2016