The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A250531 Number of (n+1)X(3+1) 0..3 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction 1
 3958, 44017, 393910, 3091263, 21783369, 142934266, 885728348, 5269466799, 30337133947, 170444570767, 938858272263, 5094247207831, 27305253854913, 144985807285630, 763985644924271, 4002062352221853, 20864575519057800 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 3 of A250536 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 R. H. Hardin, Empirical recurrence of order 65 FORMULA Empirical recurrence of order 65 (see link above) EXAMPLE Some solutions for n=2 ..1..1..2..3....0..0..1..3....0..3..1..3....0..1..1..2....0..0..2..2 ..3..2..2..3....1..1..1..3....3..1..3..3....0..1..1..3....1..1..2..2 ..0..3..3..3....3..3..3..1....0..3..3..3....0..2..1..3....0..2..1..2 CROSSREFS Sequence in context: A059666 A230707 A230617 * A319800 A034599 A007038 Adjacent sequences: A250528 A250529 A250530 * A250532 A250533 A250534 KEYWORD nonn AUTHOR R. H. Hardin, Nov 24 2014 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.

Last modified December 9 09:03 EST 2023. Contains 367690 sequences. (Running on oeis4.)