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!)
A263853 Number of 3-ascent sequences of length n with no consecutive repeated letters. 2

%I #16 Feb 17 2016 10:26:26

%S 1,1,3,12,54,276,1574,9916,68394,512671,4150148,36086135,335447341,

%T 3319876281,34853551700,386889999296,4527701024471,55715658165361,

%U 719205555167707,9717733698168073,137168409543673446,2018981393006166050,30936712227446490134

%N Number of 3-ascent sequences of length n with no consecutive repeated letters.

%H Alois P. Heinz, <a href="/A263853/b263853.txt">Table of n, a(n) for n = 0..200</a>

%H S. Kitaev, J. Remmel, <a href="http://arxiv.org/abs/1503.00914">p-Ascent Sequences</a>, arXiv preprint arXiv:1503.00914 [math.CO], 2015.

%p b:= proc(n, i, t) option remember; `if`(n<1, 1, add(

%p `if`(j=i, 0, b(n-1, j, t+`if`(j>i, 1, 0))), j=0..t+3))

%p end:

%p a:= n-> (b(n-1, 0$2)):

%p seq(a(n), n=0..30); # _Alois P. Heinz_, Nov 19 2015

%t 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 + 3}]]; a[n_] := b[n - 1, 0, 0]; Table[ a[n], {n, 0, 30}] (* _Jean-François Alcover_, Feb 17 2016, after _Alois P. Heinz_ *)

%Y Column k=3 of A264909.

%K nonn

%O 0,3

%A _N. J. A. Sloane_, Nov 18 2015

%E a(10)-a(22) from _Alois P. Heinz_, Nov 19 2015

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 March 28 14:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)