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!)
A254485 Number of (n+2) X (2+2) 0..1 arrays with every 3 X 3 subblock diagonal maximum plus antidiagonal minimum nondecreasing horizontally, vertically and ne-to-sw antidiagonally. 1
3264, 29952, 281024, 2520832, 21641920, 186176000, 1607095232, 13791593728, 118362940608, 1015944347648, 8713556258240, 74737337877248, 641154500259520, 5499739643350528, 47175146880526272, 404662090987053312 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Column 2 of A254491.
LINKS
FORMULA
Empirical: a(n) = 12*a(n-1) -21*a(n-2) -96*a(n-3) +453*a(n-4) -3068*a(n-5) +17137*a(n-6) -105968*a(n-7) +135840*a(n-8) +1507584*a(n-9) -4045824*a(n-10) +6166528*a(n-11) -32115200*a(n-12) +86695936*a(n-13) -128049152*a(n-14) -319291392*a(n-15) +1362362368*a(n-16) -1317797888*a(n-17) +8362983424*a(n-18) -27396145152*a(n-19) +35634806784*a(n-20) -6325010432*a(n-21) -97978941440*a(n-22) +161061273600*a(n-23) -622770257920*a(n-24) +2199023255552*a(n-25) -2748779069440*a(n-26) +1099511627776*a(n-27).
EXAMPLE
Some solutions for n=2
..1..0..0..1....1..1..0..1....1..1..0..0....1..0..0..1....0..1..0..1
..1..1..0..1....1..0..1..0....1..1..1..1....0..1..1..1....1..0..0..0
..0..0..0..1....0..0..1..0....1..0..0..0....1..0..0..1....1..1..1..0
..0..1..1..1....0..1..1..0....1..1..0..1....1..1..1..1....0..0..0..1
CROSSREFS
Cf. A254491.
Sequence in context: A338071 A234653 A254492 * A253857 A358870 A337792
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 31 2015
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 August 11 08:53 EDT 2024. Contains 375059 sequences. (Running on oeis4.)