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.

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

Original entry on oeis.org

1, 3, 3, 5, 9, 5, 7, 31, 31, 7, 13, 95, 101, 95, 13, 23, 309, 543, 543, 309, 23, 37, 911, 2233, 3507, 2233, 911, 37, 63, 2803, 10003, 27609, 27609, 10003, 2803, 63, 109, 8673, 47685, 201833, 371691, 201833, 47685, 8673, 109, 183, 26619, 215451, 1521573, 4406933
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Table starts
...1.....3.......5........7........13.........23.........37........63
...3.....9......31.......95.......309........911.......2803......8673
...5....31.....101......543......2233......10003......47685....215451
...7....95.....543.....3507.....27609.....201833....1521573..11678037
..13...309....2233....27609....371691....4406933...56562977.728459961
..23...911...10003...201833...4406933...89738569.1908431611
..37..2803...47685..1521573..56562977.1908431611
..63..8673..215451.11678037.728459961
.109.26619..994397.89238523
.183.81959.4603823

Examples

			Some solutions for 4X3
..1..2..1....0..2..0....2..2..0....2..1..2....1..0..0....2..0..1....0..2..2
..0..1..2....1..0..1....0..0..0....2..2..2....0..1..0....2..0..1....1..2..1
..2..1..0....2..2..2....2..1..1....1..0..1....0..0..0....0..2..0....2..1..0
..1..2..1....1..2..2....1..2..0....0..2..0....2..2..0....2..0..0....1..0..1
		

Crossrefs

Column 1 is A003229