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!)
A265990 Number of nX7 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors not equal to itself. 1

%I #4 Dec 19 2015 11:06:09

%S 1,7,9,24,59,137,422,865,2777,5666,16753,35213,94722,205921,510225,

%T 1143426,2648225,6090517,13350146,31380721,65741593,157403330,

%U 317579601,772359709,1509772802,3721329089,7080934945,17656526082,32827306561

%N Number of nX7 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors not equal to itself.

%C Column 7 of A265991.

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

%F Empirical: a(n) = a(n-1) +16*a(n-2) -15*a(n-3) -97*a(n-4) +84*a(n-5) +268*a(n-6) -208*a(n-7) -304*a(n-8) +192*a(n-9) +64*a(n-10) for n>15

%e Some solutions for n=4

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

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

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

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

%Y Cf. A265991.

%K nonn

%O 1,2

%A _R. H. Hardin_, Dec 19 2015

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 August 19 01:22 EDT 2024. Contains 375284 sequences. (Running on oeis4.)