Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097979
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097979 Total number of largest parts in all compositions of n. +0
2
1, 3, 6, 12, 23, 46, 91, 183, 367, 737, 1478, 2962, 5928, 11858, 23707, 47384, 94698, 189260, 378277, 756160, 1511730, 3022672, 6044472, 12088395, 24177600, 48359695, 96732370, 193495606, 387057584, 774248858, 1548754115, 3097980230 (list; graph; listen)
OFFSET

1,2

COMMENT

Also number of compositions of n+1 with unique largest part. - Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 03 2005

FORMULA

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

PROGRAM

(PARI) { b(t)=local(r); sum(k=1, t, forstep(s=t%k, t-k, k, u=(t-k-s)\k; r+=binomial(-2, s)*(-2)^(s-u)*binomial(s, u))); r } { a(n)=b(n)-2*b(n-1)+b(n-2) } (Alekseyev)

CROSSREFS

Cf. A097941, A046746.

Sequence in context: A050243 A024505 A005256 this_sequence A003204 A038620 A039695

Adjacent sequences: A097976 A097977 A097978 this_sequence A097980 A097981 A097982

KEYWORD

easy,nonn

AUTHOR

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

EXTENSIONS

More terms from Max Alekseyev (maxale(AT)gmail.com), Apr 16 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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research