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.

A267669 Number of 4Xn 0..1 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order.

This page as a plain text file.
%I A267669 #4 Jan 19 2016 08:10:24
%S A267669 7,98,453,3143,10933,60401,188301,951113,2812057,13690793,39294261,
%T A267669 188823533,531699829,2551208657,7083277713,34139004377,93677247421,
%U A267669 454955695853,1235099875965,6055154070065,16269918251065,80602553434841
%N A267669 Number of 4Xn 0..1 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order.
%C A267669 Row 4 of A267667.
%H A267669 R. H. Hardin, <a href="/A267669/b267669.txt">Table of n, a(n) for n = 1..210</a>
%F A267669 Empirical: a(n) = 5*a(n-1) +46*a(n-2) -255*a(n-3) -804*a(n-4) +5287*a(n-5) +6393*a(n-6) -57990*a(n-7) -17379*a(n-8) +368289*a(n-9) -70362*a(n-10) -1394997*a(n-11) +645844*a(n-12) +3138583*a(n-13) -1858369*a(n-14) -4077534*a(n-15) +2440404*a(n-16) +2940332*a(n-17) -1387260*a(n-18) -1138872*a(n-19) +275184*a(n-20) +183456*a(n-21)
%e A267669 Some solutions for n=7
%e A267669 ..0..1..0..0..1..0..1....0..1..0..1..1..0..0....0..0..1..0..1..0..1
%e A267669 ..0..0..1..0..1..1..0....0..0..1..0..1..0..1....0..1..0..1..1..0..0
%e A267669 ..1..0..1..0..1..0..1....0..1..0..1..1..0..0....1..0..1..0..1..0..0
%e A267669 ..0..1..1..0..1..0..0....0..1..1..0..0..1..0....0..0..1..0..1..0..1
%Y A267669 Cf. A267667.
%K A267669 nonn
%O A267669 1,1
%A A267669 _R. H. Hardin_, Jan 19 2016