|
| |
|
|
A123638
|
|
Consider the 2^n compositions of n and count only those ending in an odd part with row sum A001045.
|
|
3
| |
|
|
1, 1, 3, 8, 25, 83, 299, 1158, 4813, 21373, 100955, 504916, 2662761, 14754311, 85643459, 519493938, 3285790317, 21628225041, 147887079907, 1048634836288, 7698589399833, 58432476430139, 457901993065915, 3700291495531166
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| Compositions ending in an even part yield sequence 0 1 2 6 18 ... A123639. and a(n)+A123639(n) = A047970(n). Ending parity of compositions can be detected using mod(A065120,2)
|
|
|
EXAMPLE
| 4
31 32 33
211 221 222
1111
Consider the above multisets: permute and note the parity of the ending part of each of the 14 compositions.
4
31 13 32 23 33
211 121 112 221 212 122 222
1111
4 is even
31 13 23 and 33 are odd
32 is even
etc
there are 0 + 4 + 3 + 1 = 8 odd compositions therefore a(4)=8.
|
|
|
MAPLE
| g:= proc(b, t, l, m) option remember; if t=0 then b*l else add (g(b, t-1, irem(k, 2), m), k=1..m-1) +g(1, t-1, irem(m, 2), m) fi end: a:= n-> add (g(0, k, 0, n+1-k), k=1..n): seq (a(n), n=1..30);
|
|
|
CROSSREFS
| Cf. A001045 A047970 A065120 A123639 A123640 A123641.
Sequence in context: A148795 A148796 A148797 * A038665 A172382 A006372
Adjacent sequences: A123635 A123636 A123637 * A123639 A123640 A123641
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Alford Arnold (Alford1940(AT)aol.com), Oct 04 2006
|
|
|
EXTENSIONS
| Offset corrected, Maple program and more terms by Alois P. Heinz (heinz(AT)hs-heilbronn.de), Nov 06 2009
|
| |
|
|
