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

%I

%S 1,1,7,56,476,4312,41468,422128,4536140,51328018,610168496,7604171722,

%T 99154078394,1350325442746,19173655721912,283420080801700,

%U 4354942891383206,69465537443190352,1148784383085885884,19673049517219904032,348483690687062619926

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

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

%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+7))

%p end:

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

%p seq(a(n), n=0..30);

%Y Column k=7 of A264909.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Nov 28 2015

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 August 7 22:44 EDT 2020. Contains 336279 sequences. (Running on oeis4.)