login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A253030 Number of (n+2) X (2+2) 0..2 arrays with every consecutive three elements in every row and column having exactly two distinct values, and new values 0 upwards introduced in row major order. 1
1647, 12987, 102060, 802899, 6320511, 49756086, 391717269, 3084008175, 24280718976, 191165802975, 1505081513979, 11849778354006, 93295489901625, 734532751313235, 5783113524612744, 45531534681929547, 358478297068844223 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

FORMULA

Empirical: a(n) = 9*a(n-1) - 5*a(n-2) - 10*a(n-3) - 174*a(n-4) + 80*a(n-5) + 160*a(n-6).

Empirical g.f.: 27*x*(61 - 68*x - 244*x^2 - 1268*x^3 + 784*x^4 + 1280*x^5) / (1 - 9*x + 5*x^2 + 10*x^3 + 174*x^4 - 80*x^5 - 160*x^6). - Colin Barker, Dec 08 2018

EXAMPLE

Some solutions for n=3:

..0..1..1..2....0..1..0..0....0..1..0..1....0..1..1..0....0..1..1..2

..2..2..0..0....0..0..2..2....2..0..2..2....0..2..2..1....0..0..2..2

..2..1..1..2....2..1..2..2....2..1..2..1....1..2..2..0....2..1..2..1

..0..2..0..0....0..0..1..0....1..0..0..1....1..0..1..0....0..1..1..2

..0..1..0..0....0..1..1..0....2..0..2..0....0..2..2..1....0..0..1..1

CROSSREFS

Column 2 of A253035.

Sequence in context: A247077 A093059 A255620 * A252684 A203864 A154075

Adjacent sequences:  A253027 A253028 A253029 * A253031 A253032 A253033

KEYWORD

nonn

AUTHOR

R. H. Hardin, Dec 26 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 28 10:56 EDT 2021. Contains 348327 sequences. (Running on oeis4.)