login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A232396 Triangular array read by rows: T(n,k) is the number of compositions of n with no two consecutive identical parts that have exactly k parts = 1, n>=0, 0<=k<=ceiling(n/3). 2
1, 0, 1, 1, 0, 1, 2, 1, 2, 1, 3, 3, 1, 3, 8, 3, 6, 9, 7, 1, 7, 20, 10, 2, 14, 27, 25, 5, 18, 52, 39, 14, 1, 30, 77, 78, 26, 3, 45, 132, 133, 60, 8, 66, 213, 240, 117, 24, 1, 107, 334, 421, 232, 54, 4, 157, 562, 716, 450, 127, 12, 245, 872, 1265, 842, 279, 38, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,7

LINKS

Alois P. Heinz, Rows n = 0..250, flattened

FORMULA

G.f.: 1/( 1 - y*x/(1 + y*x) - Sum_{j>=2} x^j/(1 + x^j) ).

EXAMPLE

1;

0,  1;

1,  0;

1,  2;

1,  2,  1;

3,  3,  1;

3,  8,  3;

6,  9,  7,  1;

7,  20, 10, 2;

14, 27, 25, 5;

18, 52, 39, 14, 1;

T(7,2) = 7 because we have: 1+2+1+3, 1+2+3+1, 1+3+1+2, 1+3+2+1, 1+5+1, 2+1+3+1, 3+1+2+1.

MAPLE

b:= proc(n, t) option remember; `if`(n=0, 1, expand(

      add(`if`(j=t, 0, b(n-j, j)*`if`(j=1, x, 1)), j=1..n)))

    end:

T:= n-> seq(coeff(b(n, 0), x, i), i=0..ceil(n/3)):

seq(T(n), n=0..20); # Alois P. Heinz, Nov 24 2013

MATHEMATICA

nn=10; CoefficientList[Series[1/(1- u z/(1+ u z) - Sum[z^j/(1+z^j), {j, 2, nn}]), {z, 0, nn}], {z, u}]//Grid

CROSSREFS

Row sums give: A003242.

Sequence in context: A186994 A056889 A275761 * A270096 A039636 A322866

Adjacent sequences:  A232393 A232394 A232395 * A232397 A232398 A232399

KEYWORD

nonn,tabf

AUTHOR

Geoffrey Critzer, Nov 23 2013

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 05:26 EST 2019. Contains 319207 sequences. (Running on oeis4.)