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.

A205310 T(n,k)=Number of nXk 0..3 arrays with no occurrence of three equal elements in a row horizontally or vertically, and new values 0..3 introduced in row major order.

Original entry on oeis.org

1, 2, 2, 4, 15, 4, 12, 159, 159, 12, 40, 2191, 7445, 2191, 40, 143, 31168, 381958, 381958, 31168, 143, 528, 447343, 19490790, 70985206, 19490790, 447343, 528, 1979, 6427791, 996536552, 13049279920, 13049279920, 996536552, 6427791, 1979, 7466, 92387812
Offset: 1

Views

Author

R. H. Hardin Jan 25 2012

Keywords

Comments

Table starts
....1........2.............4................12.....................40
....2.......15...........159..............2191..................31168
....4......159..........7445............381958...............19490790
...12.....2191........381958..........70985206............13049279920
...40....31168......19490790.......13049279920..........8615950028840
..143...447343.....996536552.....2404472055439.......5705396521337690
..528..6427791...50933680120...442834241887042....3775750320744043966
.1979.92387812.2603456557653.81565593153176155.2499057571450100571862

Examples

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

Crossrefs

Column 1 is A204678
Column 2 is A204679