A202935 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A202935

Number of (n+3) X 7 binary arrays with consecutive windows of four bits considered as a binary number nondecreasing in every row and column.

130321, 206145, 330853, 533832, 857408, 1360328, 2121734, 3245653, 4866027, 7152307, 10315635, 14615638, 20367858, 27951842, 37819916, 50506667, 66639157, 86947893, 112278577, 143604660, 182040724, 228856716, 285493058, 353576657

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Column 4 of A202939.

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

FORMULA

Empirical: a(n) = (1/210)*n^7 + (11/20)*n^6 + (81/5)*n^5 + (1713/8)*n^4 + (90179/60)*n^3 + (337713/40)*n^2 + (15214631/420)*n + 83919.

Conjectures from Colin Barker, Jun 03 2018: (Start)

G.f.: x*(130321 - 836423*x + 2330681*x^2 - 3638908*x^3 + 3428986*x^4 - 1947234*x^5 + 616520*x^6 - 83919*x^7) / (1 - x)^8.

a(n) = 8*a(n-1) - 28*a(n-2) + 56*a(n-3) - 70*a(n-4) + 56*a(n-5) - 28*a(n-6) + 8*a(n-7) - a(n-8) for n>8.

(End)

EXAMPLE

Some solutions for n=1:

..0..0..0..0..1..1..1....0..0..0..1..0..0..0....0..0..0..1..1..0..1

..0..0..0..1..0..0..0....0..0..0..0..1..0..1....0..0..0..1..1..0..0

..0..0..0..0..0..0..1....0..0..0..1..0..0..0....0..0..0..1..0..1..1

..0..0..1..1..1..1..1....0..1..1..1..1..1..1....0..0..0..0..0..1..0

CROSSREFS

Cf. A202939.

Sequence in context: A210273 A250961 A225026 * A013893 A013693 A103534

Adjacent sequences: A202932 A202933 A202934 * A202936 A202937 A202938

KEYWORD

nonn

AUTHOR

R. H. Hardin, Dec 26 2011

STATUS

approved