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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A264910 Number of 5-ascent sequences of length n with no consecutive repeated letters. 2
 1, 1, 5, 30, 195, 1380, 10555, 86815, 764350, 7174420, 71532369, 755136887, 8415519048, 98744576456, 1216948265335, 15718032335081, 212330461568282, 2994374695258034, 44008250794756373, 672986694107199687, 10692604102273015636, 176266660430175342285 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..200 S. Kitaev, J. Remmel, p-Ascent Sequences, arXiv:1503.00914 [math.CO], 2015 MAPLE b:= proc(n, i, t) option remember; `if`(n<1, 1, add(       `if`(j=i, 0, b(n-1, j, t+`if`(j>i, 1, 0))), j=0..t+5))     end: a:= n-> (b(n-1, 0\$2)): seq(a(n), n=0..30); MATHEMATICA b[n_, i_, t_] := b[n, i, t] = If[n<1, 1, Sum[If[j==i, 0, b[n-1, j, t + If[j>i, 1, 0]]], {j, 0, t+5}]]; a[n_] := b[n-1, 0, 0]; Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Aug 14 2017, translated from Maple *) CROSSREFS Column k=5 of A264909. Sequence in context: A098663 A265085 A158828 * A196471 A265279 A034164 Adjacent sequences:  A264907 A264908 A264909 * A264911 A264912 A264913 KEYWORD nonn AUTHOR Alois P. Heinz, Nov 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.

Last modified June 3 05:29 EDT 2020. Contains 334798 sequences. (Running on oeis4.)