login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268936 Number of sequences in {1,...,n}^n with longest increasing subsequence of length n-2. 2
0, 0, 0, 10, 175, 1131, 4501, 13588, 34245, 75925, 152911, 285726, 502723, 841855, 1352625, 2098216, 3157801, 4629033, 6630715, 9305650, 12823671, 17384851, 23222893, 30608700, 39854125, 51315901, 65399751, 82564678, 103327435, 128267175, 158030281, 193335376 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

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

FORMULA

G.f.: x^3*(3*x^6-20*x^5+57*x^4-91*x^3+116*x^2+105*x+10)/(1-x)^7.

EXAMPLE

a(3) = 10: 111, 211, 221, 222, 311, 321, 322, 331, 332, 333.

a(4) = 175: 1112, 1113, 1114, 1121, ..., 4414, 4423, 4424, 4434.

CROSSREFS

A diagonal of A245667.

Sequence in context: A200574 A078516 A304445 * A144516 A053537 A049380

Adjacent sequences:  A268933 A268934 A268935 * A268937 A268938 A268939

KEYWORD

nonn,easy

AUTHOR

Alois P. Heinz, Feb 16 2016

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 04:21 EST 2021. Contains 349567 sequences. (Running on oeis4.)