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.

A263198 T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column not divisible by 13, read as a binary number with top and left being the most significant bits.

Original entry on oeis.org

22718, 366629, 366629, 5486039, 12652497, 5486039, 76647286, 398648507, 398648507, 76647286, 1068732662, 11542428929, 26007537155, 11542428929, 1068732662, 14937290926, 333834894509, 1532722380695, 1532722380695
Offset: 1

Views

Author

R. H. Hardin, Oct 11 2015

Keywords

Comments

Table starts
........22718........366629........5486039........76647286.....1068732662
.......366629......12652497......398648507.....11542428929...333834894509
......5486039.....398648507....26007537155...1532722380695.90272986428673
.....76647286...11542428929..1532722380695.180709892658771
...1068732662..333834894509.90272986428673
..14937290926.9669206035811
.209908668003

Examples

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