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!)
A225007 Number of n X 5 0..1 arrays with rows unimodal and columns nondecreasing. 3
1, 16, 86, 296, 791, 1792, 3612, 6672, 11517, 18832, 29458, 44408, 64883, 92288, 128248, 174624, 233529, 307344, 398734, 510664, 646415, 809600, 1004180, 1234480, 1505205, 1821456, 2188746, 2613016, 3100651, 3658496, 4293872, 5014592, 5828977 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..1000 (terms 1..210 from R. H. Hardin)
FORMULA
a(n) = (2/15)*n^5 + (7/6)*n^4 + (23/6)*n^3 + (35/6)*n^2 + (121/30)*n + 1.
6*a(n) = Sum_{i=1..n+1} A000384(i)*A000384(i+1). - Bruno Berselli, Feb 05 2014
From Colin Barker, Mar 16 2018: (Start)
a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6) for n >= 6.
G.f.: (1 + 10*x + 5*x^2) / (1 - x)^6. (End)
EXAMPLE
Some solutions for n=3:
0 0 0 0 0 0 0 1 0 0 0 0 1 1 1 0 0 1 1 0
0 0 0 1 0 0 1 1 0 0 0 0 1 1 1 0 0 1 1 1
0 0 1 1 0 0 1 1 1 0 0 0 1 1 1 0 1 1 1 1
6*a(7) = 40032 = 1*6 + 6*15 + 15*28 + 28*45 + 45*66 + 66*91 + 91*120 + 120*153. - Bruno Berselli, Feb 05 2014
CROSSREFS
Column 5 of A225010.
Sequence in context: A050256 A223835 A224143 * A352953 A070052 A203249
KEYWORD
nonn,easy
AUTHOR
R. H. Hardin, Apr 23 2013
EXTENSIONS
a(0)=1 prepended by Andrew Howroyd, Feb 11 2024
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 April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)