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

%I #6 Sep 03 2022 22:12:06

%S 246,3798,3798,58618,227174,58618,904734,13580282,13580282,904734,

%T 13963994,811863390,3143505700,811863390,13963994,215525422,

%U 48535019898,727704325306,727704325306,48535019898,215525422,3326498602

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

%C Table starts

%C ......246........3798...........58618.............904734...............13963994

%C .....3798......227174........13580282..........811863390............48535019898

%C ....58618....13580282......3143505700.......727704325306........168458473890432

%C ...904734...811863390....727704325306....652338909221254.....584773855532345166

%C .13963994.48535019898.168458473890432.584773855532345166.2029918047045095062378

%H R. H. Hardin, <a href="/A251524/b251524.txt">Table of n, a(n) for n = 1..180</a>

%F Empirical for column k:

%F k=1: a(n) = 15*a(n-1) +8*a(n-2) -20*a(n-3).

%F k=2: a(n) = 59*a(n-1) +67*a(n-2) -1223*a(n-3) +782*a(n-4) +1020*a(n-5) -520*a(n-6).

%F k=3: [order 15].

%F k=4: [order 40].

%e Some solutions for n=1, k=4

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

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

%K nonn,tabl

%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 March 29 00:26 EDT 2024. Contains 371264 sequences. (Running on oeis4.)