Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092265
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A092265
%S A092265 1,2,4,5,8,10,14,16,23,26,34,40,50,58,74,83,102,120,142,164,198,226,266,
%T A092265 308,359,412,482,548,634,730,834,950,1094,1240,1416,1609,1826,2068,2350,
%U A092265 2648,2994,3382,3806,4280,4826,5408,6070,6806,7619,8522,9534,10632
%N A092265 Sum of smallest parts of all partitions of n into distinct parts.
%F A092265 G.f.: Sum(-1+Product(1+x^k, k = n .. infinity), n = 1 .. infinity).
%F A092265 G.f.: Sum(x^(k*(k+1)/2)/(1-x^k)/Product(1-x^i, i=1..k), k=1..infinity). 
               - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 10 2004
%Y A092265 Cf. A046746, A005895, A006128, A092319, A092316.
%Y A092265 Cf. A026832.
%Y A092265 Sequence in context: A018498 A002048 A067941 this_sequence A163295 A101274 
               A080222
%Y A092265 Adjacent sequences: A092262 A092263 A092264 this_sequence A092266 A092267 
               A092268
%K A092265 easy,nonn
%O A092265 1,2
%A A092265 Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 14 2004
%E A092265 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 9 18:50 EST 2009. Contains 170568 sequences.


AT&T Labs Research