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!)
A251519 Number of (n+1)X(3+1) 0..3 arrays with every 2X2 subblock summing to 2 3 4 5 6 7 8 9 or 10 1

%I #4 Dec 03 2014 18:36:47

%S 58618,13580282,3143505700,727704325306,168458473890432,

%T 38996983803988656,9027534432491502252,2089812347474112645290,

%U 483777234946451208966226,111991114102820859573267808

%N Number of (n+1)X(3+1) 0..3 arrays with every 2X2 subblock summing to 2 3 4 5 6 7 8 9 or 10

%C Column 3 of A251524

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

%F Empirical: a(n) = 225*a(n-1) +2020*a(n-2) -118805*a(n-3) -274529*a(n-4) +18217165*a(n-5) -41626758*a(n-6) -389697238*a(n-7) +754598477*a(n-8) +1991291650*a(n-9) -4108606440*a(n-10) -1995135464*a(n-11) +6354576576*a(n-12) -1281849696*a(n-13) -2223288576*a(n-14) +901255680*a(n-15)

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 03 2014

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 June 4 12:12 EDT 2023. Contains 363128 sequences. (Running on oeis4.)