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!)
A268936 Number of sequences in {1,...,n}^n with longest increasing subsequence of length n-2. 2

%I

%S 0,0,0,10,175,1131,4501,13588,34245,75925,152911,285726,502723,841855,

%T 1352625,2098216,3157801,4629033,6630715,9305650,12823671,17384851,

%U 23222893,30608700,39854125,51315901,65399751,82564678,103327435,128267175,158030281,193335376

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

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

%F 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.

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

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

%Y A diagonal of A245667.

%K nonn,easy

%O 0,4

%A _Alois P. Heinz_, Feb 16 2016

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 January 25 02:37 EST 2022. Contains 350565 sequences. (Running on oeis4.)