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!)
A183656 Number of (n+1) X 4 0..5 arrays with every 2 X 2 subblock summing to 10. 1

%I #8 Apr 02 2018 08:28:42

%S 3254,9990,35162,135966,563114,2458590,11196842,52793406,256308074,

%T 1275989790,6492865322,33682946046,177764461034,952702906590,

%U 5176836594602,28481036093886,158444359333994,890260394424990

%N Number of (n+1) X 4 0..5 arrays with every 2 X 2 subblock summing to 10.

%C Column 3 of A183662.

%H R. H. Hardin, <a href="/A183656/b183656.txt">Table of n, a(n) for n = 1..200</a>

%F Empirical: a(n) = 21*a(n-1) - 175*a(n-2) + 735*a(n-3) - 1624*a(n-4) + 1764*a(n-5) - 720*a(n-6).

%F Empirical g.f.: 2*x*(1627 - 29172*x + 197411*x^2 - 622938*x^3 + 901512*x^4 - 466560*x^5) / ((1 - x)*(1 - 2*x)*(1 - 3*x)*(1 - 4*x)*(1 - 5*x)*(1 - 6*x)). - _Colin Barker_, Apr 02 2018

%e Some solutions for 3 X 4:

%e ..2..4..2..5....3..3..4..1....2..4..1..4....1..3..1..4....2..3..1..5

%e ..2..2..2..1....4..0..3..2....2..2..3..2....1..5..1..4....2..3..3..1

%e ..3..3..3..4....1..5..2..3....4..2..3..2....3..1..3..2....2..3..1..5

%Y Cf. A183662.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 06 2011

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 14:54 EDT 2024. Contains 371960 sequences. (Running on oeis4.)