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.

A180771 T(n,k) = half the number of n X k binary arrays with each element equal to at least one neighbor.

Original entry on oeis.org

0, 1, 1, 1, 3, 1, 2, 11, 11, 2, 3, 34, 63, 34, 3, 5, 111, 390, 390, 111, 5, 8, 361, 2385, 4475, 2385, 361, 8, 13, 1172, 14621, 52186, 52186, 14621, 1172, 13, 21, 3809, 89602, 606546, 1154119, 606546, 89602, 3809, 21, 34, 12377, 549125, 7053923, 25448809, 25448809
Offset: 1

Views

Author

R. H. Hardin Sep 20 2010

Keywords

Comments

Table starts
..0.....1........1...........2.............3................5
..1.....3.......11..........34...........111..............361
..1....11.......63.........390..........2385............14621
..2....34......390........4475.........52186...........606546
..3...111.....2385.......52186.......1154119.........25448809
..5...361....14621......606546......25448809.......1064583557
..8..1172....89602.....7053923.....561487456......44560487654
.13..3809...549125....82032712...12387396391....1865051797753
.21.12377..3365327...953982820..273289411333...78060898850787
.34.40218.20624430.11094190209.6029284136868.3267207111743056