Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138591
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A138591
%S A138591 1,3,5,6,7,9,10,11,12,13,14,15,17,18,19,20,21,22,23,24,25,26,27,28,29,
%T A138591 30,31,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,
%U A138591 54,55,56,57,58,59,60,61,62,63,65,66,67,68,69,70,71,72,73,74,75,76,77
%N A138591 Sums of two or more consecutive integers.
%C A138591 Closely related to but different from A057716. - N. J. A. Sloane (njas(AT)research.att.com), 
               May16 2008
%C A138591 These are called polite numbers. [From Howard Berman (howard_berman(AT)hotmail.com), 
               Oct 29 2008]
%D A138591 Wai Yan Pong, "Sums of consecutive integers", The College Mathematics 
               Journal, 38 (2007), 119-123 [From Parthasarathy Nambi (PachaNambi(AT)yahoo.com), 
               May 20 2009]
%H A138591 Wikipedia, <a href="http://en.wikipedia.org/wiki/Polite_number">Polite 
               number</a> [From Howard Berman (howard_berman(AT)hotmail.com), Oct 
               29 2008]
%e A138591 0+1=1, 1+2=3, 2+3=5, 1+2+3=6, 3+4=7, 4+5=9, 1+2+3+4=10, ...
%t A138591 Array[r,9];k=0;For[i=0,i<=33,a=i;For[j=i+1,j<=34,a=a+j;k++;r[k]=a;j++ 
               ];i++ ];q=Union[Array[r,k]];StringTake[ToString[q],99]
%Y A138591 Cf. A057716.
%Y A138591 Sequence in context: A114309 A079581 A057716 this_sequence A136492 A062506 
               A080943
%Y A138591 Adjacent sequences: A138588 A138589 A138590 this_sequence A138592 A138593 
               A138594
%K A138591 nonn,easy
%O A138591 1,2
%A A138591 Vladimir Orlovsky (4vladimir(AT)gmail.com), May 13 2008
%E A138591 More terms from Carl R. White (oeisfan(AT)phodd.net), Jul 22 2009

    
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 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research