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.

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

Original entry on oeis.org

1, 2, 2, 4, 14, 4, 11, 96, 96, 11, 30, 726, 1217, 726, 30, 82, 5400, 16813, 16813, 5400, 82, 224, 40344, 226908, 451468, 226908, 40344, 224, 612, 301056, 3074889, 11815256, 11815256, 3074889, 301056, 612, 1672, 2247264, 41618941, 311275169, 594430765
Offset: 1

Views

Author

R. H. Hardin Jan 21 2012

Keywords

Comments

Table starts
...1.......2.........4...........11.............30..............82
...2......14........96..........726...........5400...........40344
...4......96......1217........16813.........226908.........3074889
..11.....726.....16813.......451468.......11815256.......311275169
..30....5400....226908.....11815256......594430765.....30057359681
..82...40344...3074889....311275169....30057359681...2924321664147
.224..301056..41618941...8202482914..1519010368414.284567725886961
.612.2247264.563504926.216132492162.76757855124562

Examples

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

Crossrefs

Column 1 is A021006(n-3)
Column 2 is A204699