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.

Showing 1-1 of 1 results.

A205753 T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the same number of equal edges as its horizontal neighbors and a different number from its vertical neighbors, and new values 0..2 introduced in row major order.

Original entry on oeis.org

14, 48, 74, 175, 284, 413, 677, 1074, 1936, 2268, 2709, 4256, 8926, 12384, 12574, 11143, 16986, 45985, 63838, 82992, 69338, 46709, 68692, 240448, 383290, 507035, 542718, 383440, 198483, 279504, 1320659, 2244622, 3869807, 3797920, 3602578
Offset: 1

Views

Author

R. H. Hardin Jan 30 2012

Keywords

Comments

Table starts
......14.......48.......175........677........2709........11143.........46709
......74......284......1074.......4256.......16986........68692........279504
.....413.....1936......8926......45985......240448......1320659.......7401826
....2268....12384.....63838.....383290.....2244622.....14131118......88143754
...12574....82992....507035....3869807....28155907....233316016....1885888870
...69338...542718...3797920...34977686...292986186...2917623614...26828234464
..383440..3602578..29561841..341919297..3496020388..45262306396..528507252157
.2117054.23691830.224378004.3167656992.37842800738.599332178604.8142071823898

Examples

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

Crossrefs

Column 1 is A205583.
Row 1 is A205468.
Showing 1-1 of 1 results.