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.

A224667 Number of 5 X 5 0..n matrices with each 2 X 2 subblock idempotent.

This page as a plain text file.
%I A224667 #10 Sep 02 2018 12:09:31
%S A224667 196,260,332,412,500,596,700,812,932,1060,1196,1340,1492,1652,1820,
%T A224667 1996,2180,2372,2572,2780,2996,3220,3452,3692,3940,4196,4460,4732,
%U A224667 5012,5300,5596,5900,6212,6532,6860,7196,7540,7892,8252,8620,8996,9380,9772,10172
%N A224667 Number of 5 X 5 0..n matrices with each 2 X 2 subblock idempotent.
%H A224667 R. H. Hardin, <a href="/A224667/b224667.txt">Table of n, a(n) for n = 1..210</a>
%F A224667 Empirical: a(n) = 4*n^2 + 52*n + 140.
%F A224667 Conjectures from _Colin Barker_, Sep 02 2018: (Start)
%F A224667 G.f.: 4*x*(49 - 82*x + 35*x^2) / (1 - x)^3.
%F A224667 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>3.
%F A224667 (End)
%e A224667 Some solutions for n=3:
%e A224667 ..0..1..0..0..1....1..0..1..0..0....1..0..1..0..0....1..0..1..0..0
%e A224667 ..0..1..0..0..1....1..0..1..0..1....1..0..1..0..1....1..0..1..0..0
%e A224667 ..0..1..0..0..1....0..0..1..0..1....1..0..1..0..1....1..0..1..0..0
%e A224667 ..0..1..0..0..1....0..0..1..0..1....1..0..1..0..1....1..0..1..0..1
%e A224667 ..0..1..0..0..1....0..0..1..0..1....0..0..1..0..1....2..0..1..0..1
%Y A224667 Row 5 of A224665.
%K A224667 nonn
%O A224667 1,1
%A A224667 _R. H. Hardin_, Apr 14 2013