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.

A224328 Number of idempotent n X n 0..3 matrices of rank n-1.

Original entry on oeis.org

1, 14, 93, 508, 2555, 12282, 57337, 262136, 1179639, 5242870, 23068661, 100663284, 436207603, 1879048178, 8053063665, 34359738352, 146028888047, 618475290606, 2611340115949, 10995116277740, 46179488366571, 193514046488554
Offset: 1

Views

Author

R. H. Hardin, formula via M. F. Hasler _William J. Keith_ and Rob Pratt in the Sequence Fans Mailing List, Apr 03 2013

Keywords

Comments

Column 3 of A224333

Examples

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

Formula

a(n) = n*(2*4^(n-1)-1).
a(n) = 10*a(n-1) -33*a(n-2) +40*a(n-3) -16*a(n-4).
G.f.: -x*(-1-4*x+14*x^2) / ( (4*x-1)^2*(x-1)^2 ). - R. J. Mathar, Oct 21 2014