cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A277763 Number of nX4 0..2 arrays with every element equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.

Original entry on oeis.org

0, 18, 204, 9741, 270291, 8971150, 280603511, 8946059000, 283436060320, 8998418743638, 285487168951921, 9059457397078866, 287466089870053015, 9121814912567142070, 289449332145382072648, 9184699258737221554558
Offset: 1

Views

Author

R. H. Hardin, Oct 29 2016

Keywords

Comments

Column 4 of A277767.

Examples

			Some solutions for n=4
..0..1..2..0. .0..1..0..1. .0..1..2..0. .0..1..2..0. .0..1..2..0
..2..0..1..1. .2..2..2..2. .2..2..2..1. .2..0..1..1. .2..2..2..1
..1..0..0..2. .1..2..0..1. .1..0..0..2. .0..2..0..1. .2..0..1..0
..2..1..2..1. .0..0..0..2. .0..2..1..1. .1..0..0..2. .1..2..2..2
		

Crossrefs

Cf. A277767.

Formula

Empirical: a(n) = 36*a(n-1) -68*a(n-2) -2713*a(n-3) +19931*a(n-4) -62381*a(n-5) +266374*a(n-6) -1845409*a(n-7) +9104329*a(n-8) -30969250*a(n-9) +54500421*a(n-10) +53064621*a(n-11) -345542021*a(n-12) +212559402*a(n-13) +480699801*a(n-14) +192091281*a(n-15) -2417781956*a(n-16) -1829259971*a(n-17) +4066046894*a(n-18) -3571370030*a(n-19) +3097594269*a(n-20) +5886612097*a(n-21) +1760414929*a(n-22) -275686906*a(n-23) -16985592806*a(n-24) +12147734232*a(n-25) -9614561545*a(n-26) +9010271063*a(n-27) +2069102963*a(n-28) -2314404621*a(n-29) -6065137060*a(n-30) +4076313465*a(n-31) +1271741772*a(n-32) -122381968*a(n-33) -1122738002*a(n-34) +138695692*a(n-35) +82444184*a(n-36) +98140208*a(n-37) -28064564*a(n-38) -7818348*a(n-39) -4302760*a(n-40) +3035424*a(n-41) -160928*a(n-42) -59072*a(n-43) -1152*a(n-44) for n>45