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!)
A268901 Number of n X 5 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once. 1

%I #8 Jan 16 2019 09:23:30

%S 96,2664,54936,1004184,17194680,282550680,4513169016,70609114584,

%T 1087342615224,16536864398616,248976164499192,3717450986032728,

%U 55118358414612792,812385229848253848,11912420604393611640

%N Number of n X 5 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once.

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

%F Empirical: a(n) = 30*a(n-1) - 261*a(n-2) + 540*a(n-3) - 324*a(n-4).

%F Empirical g.f.: 24*x*(4 - 9*x + 3*x^2 - 18*x^3) / (1 - 15*x + 18*x^2)^2. - _Colin Barker_, Jan 16 2019

%e Some solutions for n=3:

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

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

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

%Y Column 5 of A268904.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 15 2016

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 19 07:38 EDT 2024. Contains 371782 sequences. (Running on oeis4.)