login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A224673 Number of (n+1) X 6 0..2 matrices with each 2 X 2 subblock idempotent 1

%I #10 Feb 17 2018 10:26:33

%S 115,191,257,381,542,793,1166,1746,2650,4080,6355,9996,15843,25257,

%T 40439,64951,104556,168579,272108,439556,710424,1148626,1857577,

%U 3004606,4860457,7863203,12721661,20582721,33302090,53882365,87181850,141061446

%N Number of (n+1) X 6 0..2 matrices with each 2 X 2 subblock idempotent

%C Column 5 of A224676.

%H R. H. Hardin, <a href="/A224673/b224673.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 4*a(n-1) - 5*a(n-2) + a(n-3) + 2*a(n-4) - a(n-5) for n > 6.

%F Conjectures from _Colin Barker_, Feb 17 2018: (Start)

%F G.f.: x*(115 - 269*x + 68*x^2 + 193*x^3 - 118*x^4 + 6*x^5) / ((1 - x)^3*(1 - x - x^2)).

%F a(n) = 34 + (2^(-1-n)*((1-sqrt(5))^n*(-11+53*sqrt(5)) + (1+sqrt(5))^n*(11+53*sqrt(5)))) / sqrt(5) + 14*(1+n) + (5/2)*(1 + n)*(2+n) for n>1.

%F (End)

%e Some solutions for n=3:

%e 1 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0

%e 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0

%e 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0

%e 2 1 1 1 1 1 2 0 0 1 1 1 0 0 1 0 0 0 2 1 1 1 1 1

%K nonn

%O 1,1

%A _R. H. Hardin_, Apr 14 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)