Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097976
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097976 Sum of largest parts (counted with multiplicity) in all compositions of n. +0
1
1, 4, 10, 24, 53, 118, 253, 542, 1143, 2396, 4986, 10330, 21304, 43808, 89837, 183838, 375514, 765880, 1559979, 3173794, 6450514, 13098246, 26574968, 53877266, 109153818, 221002456, 447199458, 904420716, 1828192748, 3693782678 (list; graph; listen)
OFFSET

1,2

FORMULA

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

EXAMPLE

a(3)=10 because in the compositions111,12,21,3 the largest parts are 1,2,2,3 with multiplicities 3,1,1,1,respectively and 3*1+1*2+1*2+1*3=10.

MAPLE

G:=(1-x)^2*sum(k*x^k/(1-2*x+x^(k+1))^2, k=1..45): Gser:=series(G, x=0, 40): seq(coeff(Gser, x^n), n=1..35); (Deutsch)

CROSSREFS

Cf. A097940, A092321.

Sequence in context: A107659 A162588 A080615 this_sequence A152548 A090855 A052252

Adjacent sequences: A097973 A097974 A097975 this_sequence A097977 A097978 A097979

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 07 2004

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 28 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research