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.

A183483 T(n,k)=Number of nXk 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors.

Original entry on oeis.org

1, 3, 3, 5, 15, 5, 7, 39, 39, 7, 13, 135, 117, 135, 13, 23, 495, 587, 587, 495, 23, 37, 1647, 2925, 4015, 2925, 1647, 37, 63, 5751, 12131, 40073, 40073, 12131, 5751, 63, 109, 20223, 58333, 270549, 706473, 270549, 58333, 20223, 109, 183, 70119, 270611
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Table starts
...1......3.......5.........7..........13..........23..........37..........63
...3.....15......39.......135.........495........1647........5751.......20223
...5.....39.....117.......587........2925.......12131.......58333......270611
...7....135.....587......4015.......40073......270549.....1942323....15984991
..13....495....2925.....40073......706473.....7773025...107741253..1577932971
..23...1647...12131....270549.....7773025...116198719..2519745049.56697667073
..37...5751...58333...1942323...107741253..2519745049.84056287173
..63..20223..270611..15984991..1577932971.56697667073
.109..70119.1220877.119888365.20728674493
.183.244863.5724163.894632985

Examples

			Some solutions for 5X4
..2..2..0..0....0..0..2..2....1..1..0..0....0..0..0..0....1..2..1..2
..0..0..0..0....2..0..1..1....0..0..0..0....1..2..1..2....1..1..0..2
..2..0..1..0....2..0..2..2....2..0..0..0....1..1..1..2....0..0..0..0
..2..0..1..0....0..0..0..0....2..0..1..1....2..2..0..0....1..0..1..2
..0..0..0..0....0..0..2..2....0..0..0..0....2..2..2..0....1..0..1..2
		

Crossrefs

Column 1 is A003229