login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263894 Number of permutations of [n] containing exactly ten occurrences of the consecutive pattern 132. 2
654729075, 2862426470400, 1296211708989225, 261264015391703040, 34500885158438507610, 3502077835791610920960, 297315399971212318577070, 22214713615158982916505600, 1510589164324758020706100635, 95690236900543163501872250880, 5743287914726512704740717709585 (list; graph; refs; listen; history; text; internal format)
OFFSET

21,1

LINKS

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

FORMULA

a(n) = A197365(n,10).

MAPLE

b:= proc(u, o, t) option remember; series(`if`(u+o=0, 1,

      add(b(u-j, o+j-1, 0)*`if`(j<=t, x, 1), j=1..u)+

      add(b(u+j-1, o-j, j-1), j=1..o)), x, 11)

    end:

a:= n-> coeff(b(n, 0$2), x, 10):

seq(a(n), n=21..35);

CROSSREFS

Column k=10 of A197365.

Sequence in context: A271770 A290039 A289958 * A291550 A234071 A234795

Adjacent sequences:  A263891 A263892 A263893 * A263895 A263896 A263897

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Oct 28 2015

STATUS

approved

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 July 25 23:39 EDT 2021. Contains 346294 sequences. (Running on oeis4.)