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.

A268178 Number of nX3 0..3 arrays with every repeated value in every row equal to, and in every column unequal to, the previous repeated value, and new values introduced in row-major sequential order.

Original entry on oeis.org

5, 187, 9054, 494098, 25770278, 1339895662, 68390077014, 3463876525750, 173821913942582, 8669861062288198, 430055421776241462, 21243060963214339750, 1045628843830767904502, 51323318125992835472806
Offset: 1

Views

Author

R. H. Hardin, Jan 28 2016

Keywords

Comments

Column 3 of A268180.

Examples

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

Crossrefs

Cf. A268180.

Formula

Empirical: a(n) = 108*a(n-1) -2343*a(n-2) -95508*a(n-3) +3418760*a(n-4) +23547420*a(n-5) -1342943052*a(n-6) -883192104*a(n-7) +173217160160*a(n-8) -342228942720*a(n-9) -5613350923584*a(n-10) +8457106112640*a(n-11) +55966350739968*a(n-12) -69629468894208*a(n-13) -198751111188480*a(n-14) +222436679786496*a(n-15) +215814907920384*a(n-16) -228509902503936*a(n-17) for n>19