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!)
A269210 Number of n X 4 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three exactly once. 1

%I #9 Jan 20 2019 08:56:48

%S 108,6528,308544,12548544,474091776,17118725376,599456856000,

%T 20531285093184,691495131961728,22985647571590272,756022683316823616,

%U 24651356966323488960,797979183054277922304,25672248307708057755648

%N Number of n X 4 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three exactly once.

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

%F Empirical: a(n) = 62*a(n-1) - 1031*a(n-2) + 2180*a(n-3) - 1535*a(n-4) + 350*a(n-5) - 25*a(n-6) for n>7.

%F Empirical g.f.: 12*x*(9 - 14*x + 1263*x^2 - 7188*x^3 + 10471*x^4 - 4926*x^5 + 897*x^6) / ((1 - x)^2*(1 - 30*x + 5*x^2)^2). - _Colin Barker_, Jan 20 2019

%e Some solutions for n=2:

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

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

%Y Column 4 of A269214.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 20 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.)