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.

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

Original entry on oeis.org

1, 1, 2, 1, 1, 5, 4, 5, 5, 15, 5, 10, 11, 18, 51, 14, 25, 58, 130, 63, 187, 17, 150, 142, 527, 670, 234, 715, 75, 359, 2398, 5374, 8276, 9587, 1163, 2795, 95, 2249, 6463, 58167, 69973, 133028, 51055, 4953, 11051, 411, 6511, 146947, 687222, 1999404, 3759625
Offset: 1

Views

Author

R. H. Hardin Feb 28 2013

Keywords

Comments

Table starts
......1......1........1.........4..........5.........14.........17.........75
......2......1........5........10.........25........150........359.......2249
......5......5.......11........58........142.......2398.......6463.....146947
.....15.....18......130.......527.......5374......58167.....687222...11377192
.....51.....63......670......8276......69973....1999404...20997839.1097897602
....187....234.....9587....133028....3759625...96510910.3254033272
....715...1163....51055...2363628...65204276.5825299399
...2795...4953...832433..40206464.4282689196
..11051..24021..4403793.727306856
..43947.109395.76270010
.175275.536457
.700075

Examples

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

Crossrefs

Column 1 is A007581(n-1)
Column 2 is A222373
Row 1 is A222372
Showing 1-1 of 1 results.