This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A254264 Number of (5+2)X(n+2) 0..1 arrays with every 3X3 subblock sum of the two maximums of the diagonal and antidiagonal minus the sum of the minimums of the central row and column nondecreasing horizontally, vertically and ne-to-sw antidiagonally 1
 236024, 888391, 2192422, 9308828, 35691048, 159041102, 742483152, 3525898989, 17473539574, 89203393842, 463194102932, 2440606864521, 12983765106408, 69479824462051, 373041068149038, 2009522674970372, 10836010416317362 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Row 5 of A254260 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 5*a(n-1) +25*a(n-2) -76*a(n-3) -355*a(n-4) -445*a(n-5) +5359*a(n-6) +442*a(n-7) -4555*a(n-8) +20547*a(n-9) +116695*a(n-10) -743436*a(n-11) -3659657*a(n-12) +4254133*a(n-13) +23112497*a(n-14) +35937210*a(n-15) -95391932*a(n-16) -8699352*a(n-17) -44340768*a(n-18) -1513040060*a(n-19) -4349912524*a(n-20) +7932050968*a(n-21) +48766915088*a(n-22) +27878766496*a(n-23) -182157509312*a(n-24) -419273994368*a(n-25) +155621755904*a(n-26) +1437148924928*a(n-27) +1420501656576*a(n-28) -1893948786688*a(n-29) -4904596770816*a(n-30) -1855573876736*a(n-31) +5277141549056*a(n-32) +8179702071296*a(n-33) +3548181823488*a(n-34) -6025118482432*a(n-35) -12595931643904*a(n-36) -6205421387776*a(n-37) +7060445986816*a(n-38) +11119326396416*a(n-39) +4616016101376*a(n-40) -2503663943680*a(n-41) -6217636249600*a(n-42) -4083708592128*a(n-43) +1468878815232*a(n-44) +2834678415360*a(n-45) +309237645312*a(n-46) -618475290624*a(n-47) for n>58 EXAMPLE Some solutions for n=1 ..0..1..0....1..1..1....0..1..1....0..1..1....0..0..0....1..0..0....1..0..1 ..1..0..0....1..1..1....0..1..1....1..0..0....0..0..1....1..0..0....1..1..1 ..1..0..0....1..0..0....1..0..1....1..0..0....0..0..1....0..1..1....1..1..1 ..1..0..0....0..0..0....1..0..1....1..0..1....1..0..0....1..0..0....0..0..0 ..1..1..0....1..1..0....1..0..0....1..1..0....1..0..1....1..0..1....0..1..0 ..1..0..0....1..0..0....0..0..0....1..0..1....1..1..0....1..0..1....0..0..0 ..1..1..0....1..1..0....1..0..1....1..1..0....0..0..1....1..1..0....1..0..1 CROSSREFS Sequence in context: A132905 A100780 A104286 * A254257 A254303 A269280 Adjacent sequences:  A254261 A254262 A254263 * A254265 A254266 A254267 KEYWORD nonn AUTHOR R. H. Hardin, Jan 27 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 12 15:11 EST 2019. Contains 329960 sequences. (Running on oeis4.)