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.

A202652 Number of 3X3 0..n arrays with no row or column sum equal to the previous.

Original entry on oeis.org

126, 8460, 143028, 1217196, 6835050, 29025832, 100804408, 300779112, 797002582, 1919734900, 4275569868, 8918598788, 17597763122, 33103533936, 59741213696, 103962922160, 175195148094, 286904314092, 457948263108, 714267962604
Offset: 1

Views

Author

R. H. Hardin Dec 22 2011

Keywords

Comments

Row 3 of A202651

Examples

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

Formula

Empirical: a(n) = 5*a(n-1) -6*a(n-2) -9*a(n-3) +24*a(n-4) -3*a(n-5) -26*a(n-6) +7*a(n-7) +18*a(n-8) +7*a(n-9) -26*a(n-10) -3*a(n-11) +24*a(n-12) -9*a(n-13) -6*a(n-14) +5*a(n-15) -a(n-16)