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!)
A214254 Number compositions of n where differences between neighboring parts are in {-2,2}. 3

%I #11 Dec 20 2014 17:03:16

%S 1,1,1,1,3,2,3,2,6,4,4,3,13,6,5,6,21,10,10,9,33,18,14,15,58,30,19,27,

%T 96,51,31,44,159,89,45,77,271,152,66,133,456,263,104,228,768,458,156,

%U 395,1310,791,236,685,2228,1371,363,1187,3802,2380,551,2056,6509

%N Number compositions of n where differences between neighboring parts are in {-2,2}.

%H Alois P. Heinz, <a href="/A214254/b214254.txt">Table of n, a(n) for n = 0..1000</a>

%e a(7) = 2: [7], [3,1,3].

%e a(8) = 6: [8], [5,3], [3,5], [3,1,3,1], [2,4,2], [1,3,1,3].

%e a(9) = 4: [9], [5,3,1], [1,3,5], [1,3,1,3,1].

%p b:= proc(n, i) option remember;

%p `if`(n<1 or i<1, 0, `if`(n=i, 1, add(b(n-i, i+j), j=[-2, 2])))

%p end:

%p a:= n-> `if`(n=0, 1, add(b(n, j), j=1..n)):

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

%t b[n_, i_] := b[n, i] = If[n < 1 || i < 1, 0, If[n == i, 1, Sum[b[n-i, i+j], { j, {-2, 2}}]]]; a[n_] := If[n == 0, 1, Sum[b[n, j], {j, 1, n}]]; Table [a[n], {n, 0, 80}] // Flatten (* _Jean-François Alcover_, Dec 13 2013, translated from Maple *)

%Y Column k=2 of A214247.

%K nonn

%O 0,5

%A _Alois P. Heinz_, Jul 08 2012

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 April 16 14:03 EDT 2024. Contains 371736 sequences. (Running on oeis4.)