Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105200
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105200 Number of compositions of n such that the least part occurs with odd multiplicity. +0
3
1, 1, 4, 3, 13, 16, 41, 64, 154, 261, 560, 1049, 2176, 4169, 8474, 16614, 33477, 66178, 132776, 263969, 528519, 1053483, 2107772, 4207680, 8415341, 16812773, 33622527, 67203682, 134391649, 268686218, 537318189, 1074403625, 2148636672 (list; graph; listen)
OFFSET

1,3

FORMULA

G.f.: Sum(Sum(binomial(k, 2*l-1)*x^(2*k-2*l+1)/((1-x)^(k-2*l+1)*(1-x^k)), l=1..floor((k+1)/2)), k=1..infinity).

MATHEMATICA

Rest[ CoefficientList[ Series[ Sum[ Binomial[k, 2l - 1] x^(2k - 2l + 1)/((1 - x)^(k - 2*l + 1)(1 - x^k)), {k, 34}, {l, Floor[(k + 1)/2]}], {x, 0, 34}], x]] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 12 2005)

CROSSREFS

Cf. A096375.

Sequence in context: A120340 A082018 A056477 this_sequence A088933 A019136 A140884

Adjacent sequences: A105197 A105198 A105199 this_sequence A105201 A105202 A105203

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 12 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 12 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research