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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323969 Number of 5 X n integer matrices (m_{i,j}) such that m_{1,1}=0, m_{5,n}=2, and all rows, columns, and falling diagonals are (weakly) monotonic without jumps of 2. 2
1, 6, 41, 266, 1247, 4657, 14795, 41586, 106067, 249814, 550334, 1145148, 2268140, 4302757, 7857830, 13873160, 23763590, 39612078, 64424311, 102459670, 159655885, 244167521, 367041525, 543056454, 791755709, 1138709134, 1617041716, 2269272856, 3149514786 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..10000

FORMULA

G.f.: -(3*x^11 -29*x^10 +125*x^9 -314*x^8 +501*x^7 -517*x^6 +323*x^5 -84*x^4 -20*x^3 +30*x^2 -5*x+1) / (x-1)^11.

CROSSREFS

Row (or column) 5 of array in A323846.

Sequence in context: A320090 A266425 A194781 * A252980 A274997 A015551

Adjacent sequences: A323966 A323967 A323968 * A323970 A323971 A323972

KEYWORD

nonn,easy

AUTHOR

Alois P. Heinz, Feb 09 2019

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 December 7 23:32 EST 2022. Contains 358671 sequences. (Running on oeis4.)