Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026906
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A026906
%S A026906 1,2,4,6,9,13,18,24,32,42,54,69,87,109,136,168,206,252,306,370,
%T A026906 446,535,639,761,903,1068,1260,1482,1738,2034,2374,2764,3212,
%U A026906 3724,4309,4977,5737,6601,7583,8696,9956,11382,12992,14808,16856
%N A026906 Number of sums S of distinct positive integers satisfying S <= n.
%t A026906 Table[ Sum[ PartitionsQ[k], {k, 1, n}], {n, 1, 50}]
%Y A026906 Partial sums of A000009.
%Y A026906 Sequence in context: A000064 A001305 A088575 this_sequence A050811 A039900 
               A039902
%Y A026906 Adjacent sequences: A026903 A026904 A026905 this_sequence A026907 A026908 
               A026909
%K A026906 nonn
%O A026906 1,2
%A A026906 Clark Kimberling (ck6(AT)evansville.edu)

    
page 1

Search completed in 0.001 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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research