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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A246247 Number of permutations of [n] with exactly two occurrences of the consecutive step pattern up, down, down. 2
 99, 2214, 38394, 591543, 8826246, 131367258, 1989555210, 30951663300, 497599843140, 8291940960690, 143459287215300, 2578465192541220, 48147387009459165, 933704978071539690, 18794023286090727870, 392361396798154377681, 8489006744706293477274 (list; graph; refs; listen; history; text; internal format)
 OFFSET 7,1 LINKS Alois P. Heinz and Vaclav Kotesovec, Table of n, a(n) for n = 7..300 (first 160 terms from Alois P. Heinz) FORMULA a(n) ~ c * (3*sqrt(3)/(2*Pi))^n * n! * n^2, where c = 0.10205535828170995196503... = c0 * (c0-1)^2 / 18, and c0 = (1 + exp(Pi/sqrt(3))) * sqrt(3) / (2*Pi). - Vaclav Kotesovec, Aug 22 2014 MAPLE b:= proc(u, o, t) option remember; `if`(u+o=0, 1, expand( add(b(u-j, o+j-1, [1, 3, 1][t])*`if`(t=3, x, 1), j=1..u)+ add(b(u+j-1, o-j, 2), j=1..o))) end: T:= n-> (p-> seq(coeff(p, x, i), i=0..degree(p)))(b(n, 0, 1)): seq([T(n)][3], n=7..20); # Vaclav Kotesovec, Aug 22 2014 after Alois P. Heinz MATHEMATICA b[u_, o_, t_] := b[u, o, t] = If[u + o == 0, 1, Expand[Sum[b[u - j, o + j - 1, {1, 3, 1}[[t]]]*If[t == 3, x, 1], {j, 1, u}] + Sum[b[u + j - 1, o - j, 2], {j, 1, o}]]]; a[n_] := Coefficient[b[n, 0, 1], x, 2]; a /@ Range[7, 20] (* Jean-François Alcover, Dec 28 2020, after Maple *) CROSSREFS Column k=2 of A242819. Sequence in context: A197372 A174944 A221330 * A157370 A163040 A133319 Adjacent sequences: A246244 A246245 A246246 * A246248 A246249 A246250 KEYWORD nonn AUTHOR Alois P. Heinz, Aug 20 2014 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.

Last modified August 9 05:47 EDT 2024. Contains 375027 sequences. (Running on oeis4.)