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.

A267975 Number of 1 X n 0..3 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value.

Original entry on oeis.org

4, 16, 64, 250, 964, 3674, 13868, 51917, 192980, 712868, 2618876, 9573915, 34845780, 126322410, 456285828, 1642687662, 5895922368, 21102304252, 75332038300, 268275675007, 953247943192, 3380004168904, 11961143709736, 42249741430325
Offset: 1

Views

Author

R. H. Hardin, Jan 23 2016

Keywords

Comments

Row 1 of A267974.

Examples

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

Crossrefs

Cf. A267974.

Formula

Empirical: a(n) = 12*a(n-1) - 50*a(n-2) + 72*a(n-3) + 21*a(n-4) - 72*a(n-5) - 50*a(n-6) - 12*a(n-7) -a(n-8).
Empirical g.f.: x*(4 - 32*x + 72*x^2 - 6*x^3 - 72*x^4 - 50*x^5 - 12*x^6 - x^7) / (1 - 3*x - x^2)^4. - Colin Barker, Feb 26 2018