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.

A222906 T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..3 order.

Original entry on oeis.org

1, 1, 2, 1, 4, 5, 4, 7, 14, 15, 5, 25, 45, 75, 51, 14, 92, 373, 767, 411, 187, 17, 403, 1202, 7794, 4909, 2522, 715, 75, 1710, 18981, 101398, 180203, 119393, 15919, 2795, 95, 8021, 82020, 1346067, 2117424, 4320431, 759891, 103627, 11051, 411, 36160
Offset: 1

Views

Author

R. H. Hardin Mar 09 2013

Keywords

Comments

Table starts
......1.........1............1................4.................5
......2.........4............7...............25................92
......5........14...........45..............373..............1202
.....15........75..........767.............7794............101398
.....51.......411.........4909...........180203...........2117424
....187......2522.......119393..........4320431.........213112150
....715.....15919.......759891........105327353........4854855483
...2795....103627.....20299463.......2592612272......488736554328
..11051....683480....130579169......64243363904....11422629770589
..43947...4554799...3588643955....1600125512239..1152667562787040
.175275..30542304..23230932391...40022606753953.27237086853444410
.700075.205785953.647426033879.1004596097977296

Examples

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

Crossrefs

Column 1 is A007581(n-1)
Row 1 is A222372