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!)
A234487 Number of (n+1) X (5+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings). 1
14402, 51950, 187196, 677138, 2455350, 8928348, 32545706, 118945534, 435728940, 1600124066, 5889188814, 21725555324, 80316758842, 297580824166, 1104798114372, 4110348767602, 15322030940326, 57230791424428 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
Empirical: a(n) = 21*a(n-1) -128*a(n-2) -301*a(n-3) +6470*a(n-4) -16377*a(n-5) -92720*a(n-6) +529264*a(n-7) +144134*a(n-8) -6281248*a(n-9) +8587390*a(n-10) +35733302*a(n-11) -92619285*a(n-12) -93289189*a(n-13) +447345822*a(n-14) +55762321*a(n-15) -1262355944*a(n-16) +278493999*a(n-17) +2300746886*a(n-18) -753516820*a(n-19) -2817152264*a(n-20) +837146044*a(n-21) +2311698968*a(n-22) -448826360*a(n-23) -1224869744*a(n-24) +85822528*a(n-25) +391294592*a(n-26) +16553184*a(n-27) -67375296*a(n-28) -8961408*a(n-29) +4757760*a(n-30) +967680*a(n-31).
EXAMPLE
Some solutions for n=3:
2 0 2 0 0 0 2 0 0 3 0 1 2 3 2 0 3 0 3 0 3 1 3 0
1 1 1 1 3 1 3 3 1 2 1 0 2 1 2 2 3 2 2 1 2 2 2 1
1 3 1 3 3 3 1 3 3 2 3 0 1 2 1 3 2 3 0 1 0 2 0 1
0 0 0 0 2 0 1 1 3 0 3 2 3 2 3 3 0 3 3 2 3 3 3 2
CROSSREFS
Column 5 of A234490.
Sequence in context: A203729 A144649 A166371 * A234977 A250960 A238060
KEYWORD
nonn
AUTHOR
R. H. Hardin, Dec 26 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 31 17:27 EDT 2024. Contains 374808 sequences. (Running on oeis4.)