|
|
A119749
|
|
Number of compositions of n into odd blocks with one element in each block distinguished.
|
|
2
|
|
|
1, 1, 4, 7, 15, 32, 65, 137, 284, 591, 1231, 2560, 5329, 11089, 23076, 48023, 99935, 207968, 432785, 900633, 1874236, 3900319, 8116639, 16890880, 35150241, 73148321, 152223044, 316779047, 659223215, 1371856032, 2854858465
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
The sequence is the INVERT transform of the aerated odd integers. - Gary W. Adamson, Feb 02 2014
Number of compositions of n into odd parts where there is 1 sort of part 1, 3 sorts of part 3, 5 sorts of part 5, ... , 2*k-1 sorts of part 2*k-1. - Joerg Arndt, Aug 04 2014
|
|
LINKS
|
|
|
FORMULA
|
G.f.: (x+x^3)/(x^4 - x^3 -2x^2 -x +1).
|
|
EXAMPLE
|
a(3) = 4 since Abc, aBc, abC come from one block of size 3 and A/B/C comes from having three blocks. The capital letters are the distinguished elements.
|
|
MATHEMATICA
|
Rest@ CoefficientList[ Series[x(1 + x^2)/(x^4 - x^3 - 2x^2 - x + 1), {x, 0, 50}], x] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|