Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092311
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A092311
%S A092311 1,2,4,5,7,10,12,14,19,23,26,33,38,44,56,63,71,88,99,114,138,155,176,
%T A092311 208,237,269,314,357,402,468,529,594,686,772,873,999,1119,1260,1431,
%U A092311 1608,1804,2039,2284,2554,2884,3219,3590,4032,4493,5011,5603,6231,6928
%N A092311 Total number of largest parts in all partitions of n into odd parts.
%F A092311 G.f.: Sum((x^(2*n-1)/(1-x^(2*n-1)))/Product((1-x^(2*k-1)), k=1..n), n=1..infinity).
%e A092311 Partitions of 6 into odd parts are: [1,1,1,1,1,1], [1,1,1,3], [3,3], 
               [1,5]; thus a(6)=6+1+2+1=10.
%Y A092311 Cf. A092314 A092322 A092269 A092309 A092321 A092313 A092310 A092268
%Y A092311 Sequence in context: A093013 A047495 A005653 this_sequence A058212 A007997 
               A123120
%Y A092311 Adjacent sequences: A092308 A092309 A092310 this_sequence A092312 A092313 
               A092314
%K A092311 easy,nonn
%O A092311 1,2
%A A092311 Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 16 2004
%E A092311 More terms from Pab Ter (pabrlos(AT)yahoo.com), May 25 2004

    
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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research