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!)
A229668 Number of defective 4-colorings of an n X 4 0..3 array connected horizontally, antidiagonally and vertically with exactly two mistakes, and colors introduced in row-major 0..3 order. 1
3, 652, 19805, 328160, 4331928, 50919512, 557478448, 5814322288, 58526242224, 573293485312, 5495680088320, 51763989177088, 480493519118080, 4405407183929600, 39966207303657728, 359270403366182912 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 4 of A229672.

LINKS

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

FORMULA

Empirical: a(n) = 36*a(n-1) - 552*a(n-2) + 4812*a(n-3) - 27168*a(n-4) + 107904*a(n-5) - 316720*a(n-6) + 703296*a(n-7) - 1187712*a(n-8) + 1506368*a(n-9) - 1379328*a(n-10) + 835584*a(n-11) - 262144*a(n-12) for n > 14.

EXAMPLE

Some solutions for n=3:

  0 1 0 0     0 1 2 1     0 1 2 3     0 1 2 3     0 1 2 3

  2 3 2 1     2 2 0 2     0 3 1 0     3 0 0 2     2 3 0 2

  0 0 3 2     0 1 3 0     2 0 3 3     2 1 2 0     1 0 1 1

CROSSREFS

Sequence in context: A230808 A158600 A092301 * A165343 A278316 A266639

Adjacent sequences:  A229665 A229666 A229667 * A229669 A229670 A229671

KEYWORD

nonn

AUTHOR

R. H. Hardin, Sep 27 2013

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 17 21:17 EDT 2021. Contains 348065 sequences. (Running on oeis4.)