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!)
A228672 Number of permutations of [n] having a shortest ascending run of length 5. 2
1, 0, 0, 0, 0, 251, 922, 1582, 2572, 4002, 756755, 6029297, 31742676, 120956707, 398182782, 12794989968, 166170816448, 1418774022895, 9698826682676, 55499002033421, 894582818429967, 14637215156295242, 177486208140377619, 1730337098015002802 (list; graph; refs; listen; history; text; internal format)
OFFSET
5,6
LINKS
Alois P. Heinz and Vaclav Kotesovec, Table of n, a(n) for n = 5..350 (first 100 terms from Alois P. Heinz)
FORMULA
a(n) ~ c * d^n * n!, where d = 0.4206507959..., c = 0.1811532007... . - Vaclav Kotesovec, Sep 07 2014
CROSSREFS
Column k=5 of A064315.
Sequence in context: A052232 A179231 A108833 * A339182 A008917 A025396
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Aug 29 2013
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 July 13 10:13 EDT 2024. Contains 374282 sequences. (Running on oeis4.)