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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A243229 Number of isoscent sequences of length n with exactly three ascents. 2
 17, 229, 1819, 11172, 58847, 280158, 1242859, 5238042, 21245548, 83685745, 322225735, 1218705577, 4544214608, 16751906196, 61188410692, 221832968059, 799344529621, 2865983103387, 10233713828145, 36419029944617, 129245774064864, 457623216922119 (list; graph; refs; listen; history; text; internal format)
 OFFSET 6,1 LINKS Joerg Arndt and Alois P. Heinz, Table of n, a(n) for n = 6..100 FORMULA G.f.: x^6*(17 - 213*x + 1118*x^2 - 3135*x^3 + 4851*x^4 - 3492*x^5 - 262*x^6 + 1707*x^7 + 82*x^8 - 1050*x^9 + 189*x^10 + 297*x^11 - 122*x^12 + 11*x^13 + 3*x^14) / ((1 - x)^4*(1 - 2*x)^3*(1 - 4*x + 3*x^2 + x^3)^2*(1 - 8*x + 21*x^2 - 18*x^3 - 3*x^4 + 5*x^5 + 3*x^6)) (conjectured). - Colin Barker, May 04 2019 MAPLE b:= proc(n, i, t) option remember; `if`(n<1, 1, expand(add( `if`(j>i, x, 1) *b(n-1, j, t+`if`(j=i, 1, 0)), j=0..t+1))) end: a:= n-> coeff(b(n-1, 0\$2), x, 3): seq(a(n), n=6..35); MATHEMATICA b[n_, i_, t_] := b[n, i, t] = If[n < 1, 1, Expand[Sum[ If[j>i, x, 1] *b[n-1, j, t + If[j == i, 1, 0]], {j, 0, t+1}]]]; a[n_] := Coefficient[b[n - 1, 0, 0], x, 3]; Table[a[n], {n, 6, 35}] (* Jean-François Alcover, Aug 27 2021, after Maple code *) CROSSREFS Column k=3 of A242351. Sequence in context: A152589 A163853 A142547 * A329015 A016166 A358712 Adjacent sequences: A243226 A243227 A243228 * A243230 A243231 A243232 KEYWORD nonn AUTHOR Joerg Arndt and Alois P. Heinz, Jun 01 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 March 27 12:09 EDT 2023. Contains 361570 sequences. (Running on oeis4.)