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.

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

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 4, 5, 5, 4, 5, 18, 9, 18, 5, 14, 59, 112, 112, 59, 14, 17, 200, 426, 1087, 426, 200, 17, 70, 820, 4790, 11442, 11442, 4790, 820, 70, 89, 3014, 18007, 128213, 111951, 128213, 18007, 3014, 89, 326, 11364, 208768, 1471412, 3778560, 3778560, 1471412
Offset: 1

Views

Author

R. H. Hardin Feb 25 2013

Keywords

Comments

Table starts
....1......1.........1...........4............5............14.............17
....1......1.........5..........18...........59...........200............820
....1......5.........9.........112..........426..........4790..........18007
....4.....18.......112........1087........11442........128213........1471412
....5.....59.......426.......11442.......111951.......3778560.......41768676
...14....200......4790......128213......3778560.....120603073.....4091063379
...17....820.....18007.....1471412.....41768676....4091063379...133111379646
...70...3014....208768....17068476...1506610325..143156705294.14368353140562
...89..11364....783389...198654710..17357088679.5118550268413
..326..42748...9222742..2328829654.636943229353
..413.164652..34725955.27335961632
.1630.627034.412489970

Examples

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

Crossrefs

Column 1 is A222364
Column 2 is A222567
Showing 1-1 of 1 results.