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.

A222842 T(n,k) is the number of n X k 0..3 arrays with no more than floor(n*k/2) elements equal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..3 order.

Original entry on oeis.org

1, 1, 1, 2, 8, 2, 11, 105, 105, 11, 34, 1585, 4797, 1585, 34, 131, 23107, 326408, 326408, 23107, 131, 438, 353631, 15364848, 70144361, 15364848, 353631, 438, 2150, 5338646, 1077545438, 15371324917, 15371324917, 1077545438, 5338646, 2150, 7676
Offset: 1

Views

Author

R. H. Hardin, Mar 06 2013

Keywords

Comments

Table starts:
.....1..........1.............2..............11................34
.....1..........8...........105............1585.............23107
.....2........105..........4797..........326408..........15364848
....11.......1585........326408........70144361.......15371324917
....34......23107......15364848.....15371324917....10720259944904
...131.....353631....1077545438...3410802057085.11000375151330544
...438....5338646...52487425596.763478480305913
..2150...81874696.3689615795056
..7676.1252153841
.32491

Examples

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

Crossrefs

Columns 1..4 are A222650, A222839, A222840, A222841.