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.

A301839 Number of nX6 0..1 arrays with every element equal to 0, 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A301839 #4 Mar 27 2018 14:29:39
%S A301839 32,855,15199,281758,5240684,97439921,1812097252,33701001773,
%T A301839 626769301255,11656674265408,216791623977204,4031908496993218,
%U A301839 74985787605598453,1394592394913802694,25936755278154522723
%N A301839 Number of nX6 0..1 arrays with every element equal to 0, 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.
%C A301839 Column 6 of A301841.
%H A301839 R. H. Hardin, <a href="/A301839/b301839.txt">Table of n, a(n) for n = 1..210</a>
%F A301839 Empirical: a(n) = 45*a(n-1) -812*a(n-2) +8427*a(n-3) -59225*a(n-4) +308634*a(n-5) -1256189*a(n-6) +4115169*a(n-7) -11046335*a(n-8) +24584435*a(n-9) -45781016*a(n-10) +71898912*a(n-11) -95852394*a(n-12) +108964324*a(n-13) -105845027*a(n-14) +87815455*a(n-15) -62033967*a(n-16) +37077135*a(n-17) -18559186*a(n-18) +7664773*a(n-19) -2558244*a(n-20) +670720*a(n-21) -132612*a(n-22) +18528*a(n-23) -1616*a(n-24) +64*a(n-25) for n>27
%e A301839 Some solutions for n=5
%e A301839 ..0..1..1..0..1..0. .0..0..1..0..0..1. .0..1..1..0..0..1. .0..0..1..0..1..1
%e A301839 ..0..0..1..0..0..1. .0..1..0..1..0..0. .0..0..1..0..0..1. .0..1..1..0..1..0
%e A301839 ..0..0..1..1..0..1. .0..1..1..0..1..1. .0..0..1..0..0..1. .0..1..0..0..1..0
%e A301839 ..0..0..1..0..1..0. .0..0..1..0..0..1. .0..0..1..0..0..1. .0..1..1..0..1..0
%e A301839 ..0..1..1..1..0..0. .0..1..1..0..1..0. .0..0..1..1..0..0. .0..0..1..0..1..0
%Y A301839 Cf. A301841.
%K A301839 nonn
%O A301839 1,1
%A A301839 _R. H. Hardin_, Mar 27 2018