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!)
A201687 a(1)=0; a(n) = b(n) - Sum_{r=1..n-1} a(r)*b(n-1-r), where b(n) = A000085(n). 1

%I #23 Apr 15 2022 10:32:44

%S 0,2,2,6,14,44,134,462,1616,6062,23306,93996,389102,1671158,7360256,

%T 33418374,155359922,741476492,3617591462,18065875422,92087408048,

%U 479382896030,2543670789962,13759520646636,75769638724382,424727826838886,2420944511425472

%N a(1)=0; a(n) = b(n) - Sum_{r=1..n-1} a(r)*b(n-1-r), where b(n) = A000085(n).

%H J.-L. Baril, <a href="https://doi.org/10.37236/665">Classical sequences revisited with permutations avoiding dotted pattern</a>, Electronic Journal of Combinatorics, 18 (2011), #P178. See Table 3.

%p b:= proc(n) option remember; `if`(n<1, 1, b(n-1)+(n-1)*b(n-2)) end:

%p a:= proc(n) option remember; `if`(n<2, 0,

%p b(n)-add(a(r)*b(n-1-r), r=1..n-1))

%p end:

%p seq(a(n), n=1..28); # _Alois P. Heinz_, Apr 14 2022

%t b[n_] := b[n] = If[n < 1, 1, b[n - 1] + (n - 1)*b[n - 2]];

%t a[n_] := a[n] = If[n < 2, 0, b[n] - Sum[a[r]*b[n - 1 - r], {r, 1, n - 1}]];

%t Table[a[n], {n, 1, 28}] (* _Jean-François Alcover_, Apr 15 2022, after _Alois P. Heinz_ *)

%Y Cf. A000085, A201689.

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Dec 03 2011

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 July 13 14:24 EDT 2024. Contains 374284 sequences. (Running on oeis4.)