A228676 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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 62nd year, we have over 390,000 sequences, and we’ve reached 12,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A228676

Number of permutations of [n] having a shortest ascending run of length 9.

1, 0, 0, 0, 0, 0, 0, 0, 0, 48619, 184754, 335918, 587858, 994838, 1634378, 2615006, 4085948, 6249098, 227873431499, 1914096764581, 10597168136104, 42893468596297, 150965696385640, 488842369407373, 1495597557713296, 4389498481714495, 12479738997128938

(list; graph; refs; listen; history; text; internal format)

OFFSET

9,10

LINKS

Alois P. Heinz, Table of n, a(n) for n = 9..100

CROSSREFS

Column k=9 of A064315.

Sequence in context: A237105 A234230 A251597 * A268852 A024753 A024761

Adjacent sequences: A228673 A228674 A228675 * A228677 A228678 A228679

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Aug 29 2013

STATUS

approved