The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A268936 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A268936

Number of sequences in {1,...,n}^n with longest increasing subsequence of length n-2.
(history; published version)

#4 by Alois P. Heinz at Tue Feb 16 06:10:16 EST 2016

STATUS

editing

approved

#3 by Alois P. Heinz at Tue Feb 16 06:07:23 EST 2016

LINKS

Alois P. Heinz, <a href="/A268936/b268936.txt">Table of n, a(n) for n = 0..1000</a>

KEYWORD

nonn,easy,changed

#2 by Alois P. Heinz at Tue Feb 16 05:38:17 EST 2016

NAME

allocated for Alois P. Heinz

Number of sequences in {1,...,n}^n with longest increasing subsequence of length n-2.

DATA

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

OFFSET

0,4

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.

KEYWORD

allocated

nonn

AUTHOR

Alois P. Heinz, Feb 16 2016

STATUS

approved

editing

#1 by Alois P. Heinz at Tue Feb 16 05:38:17 EST 2016

NAME

allocated for Alois P. Heinz

KEYWORD

allocated

STATUS

approved