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.

A250574 T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with nondecreasing maximum of every three consecutive values in every row and column.

Original entry on oeis.org

512, 3375, 3375, 21952, 39852, 21952, 140608, 463006, 463006, 140608, 884736, 5281190, 9583440, 5281190, 884736, 5545233, 59025322, 194160522, 194160522, 59025322, 5545233, 34645976, 656805747, 3844025984, 6967413024, 3844025984
Offset: 1

Views

Author

R. H. Hardin, Nov 25 2014

Keywords

Comments

Table starts
.......512........3375..........21952............140608..............884736
......3375.......39852.........463006...........5281190............59025322
.....21952......463006........9583440.........194160522..........3844025984
....140608.....5281190......194160522........6967413024........243722971680
....884736....59025322.....3844025984......243722971680......15037777879872
...5545233...656805747....75733658665.....8480014708481.....922491768788283
..34645976..7283102949..1486288137310...293803461491618...56336934011827612
.216000000.80572967431.29093999130722.10151010566609616.3430565103477146672

Examples

			Some solutions for n=2 k=4
..0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0
..1..0..1..0..1..0....0..1..1..0..1..0....1..0..0..1..1..1....0..0..0..1..1..0
..1..0..1..1..1..0....0..0..0..1..0..0....0..0..1..0..0..1....0..0..0..0..0..0
..0..1..1..0..0..1....1..1..1..0..0..1....1..0..0..1..0..1....1..1..0..1..0..0
		

Crossrefs

Column 1 is A189155(n+2)

Formula

Empirical for column k:
k=1: [linear recurrence of order 19]
k=2: [order 49]