The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A210158 Number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock having two or three distinct values, and new values 0..3 introduced in row major order. 1

%I

%S 13,148,1977,27720,393649,5608216,79963353,1140367704,16263750913,

%T 231954064216,3308145663081,47181050078808,672900213492241,

%U 9596961465020248,136872702133795833,1952090431423132248

%N Number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock having two or three distinct values, and new values 0..3 introduced in row major order.

%C Column 1 of A210165.

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

%F Empirical: a(n) = 16*a(n-1) - 19*a(n-2) - 80*a(n-3) - 36*a(n-4).

%F Empirical g.f.: x*(13 - 60*x - 144*x^2 - 60*x^3) / ((1 - 3*x - 2*x^2)*(1 - 13*x - 18*x^2)). - _Colin Barker_, Jul 14 2018

%e Some solutions for n=4:

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

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

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

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

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

%Y Cf. A210165.

%K nonn

%O 1,1

%A _R. H. Hardin_, Mar 18 2012

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

Last modified November 26 21:07 EST 2021. Contains 349344 sequences. (Running on oeis4.)