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!)
A346324 Number of permutations of [n] having nine cycles of the form (c1, c2, ..., c_m) where c1 = min_{i>=1} c_i and c_j = min_{i>=j} c_i or c_j = max_{i>=j} c_i. 2
1, 45, 1320, 31680, 677391, 13462449, 254795255, 4662766680, 83340628657, 1465044247953, 25454998074402, 438717429420660, 7520382153446728, 128469777544339440, 2190375675509324512, 37315178727984493248, 635733806304497380480, 10838531804748912309760 (list; graph; refs; listen; history; text; internal format)
OFFSET

9,2

LINKS

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

Index entries for linear recurrences with constant coefficients, order 45.

MAPLE

b:= proc(n) option remember; series(`if`(n=0, 1, add(b(n-j)

      *binomial(n-1, j-1)*x*ceil(2^(j-2)), j=1..n)), x, 10)

    end:

a:= n-> coeff(b(n), x, 9):

seq(a(n), n=9..29);

CROSSREFS

Column k=9 of A344855.

Sequence in context: A199518 A075515 A330389 * A243570 A145151 A027476

Adjacent sequences:  A346321 A346322 A346323 * A346325 A346326 A346327

KEYWORD

nonn,easy

AUTHOR

Alois P. Heinz, Jul 13 2021

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 October 1 11:02 EDT 2022. Contains 357147 sequences. (Running on oeis4.)