Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033501
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A033501
%S A033501 1,2,3,4,6,8,9,12,15,16,18,20,24,25,28,30,35,36,40,42,48,49,54,56,60,
%T A033501 63,64,70,72,77,80,81,88,90,96,99,100,108,110,117,120,121,130,132,140,
%U A033501 143,144,150,154,156,165,168,169,176,180,182,192,195,196,204,208,210
%N A033501 Almost-squares: m such that m/p(m) >= k/p(k) for all k<m, where p(m) 
               is the least perimeter of a rectangle with integer side lengths and 
               area m.
%H A033501 Greg Martin, <a href="http://arXiv.org/abs/math.NT/9807108">Farmer Ted 
               Goes Natural</a>, Math. Mag. 72 (1999), no. 4, 259-276.
%t A033501 chs={1}; For[ n=2, n<=99, n++, chs=Join[ chs, Reverse[ Table[ (n-1-i)(n+i), 
               {i, 0, (Sqrt[ 2n-1 ]-1)/2} ] ], Reverse[ Table[ (n-i)(n+i), {i, 0, 
               n/Sqrt[ 2n-1 ]} ] ] ] ]
%t A033501 (*code uses alternate characterization, lists almost-squares up to 99^2*)
%Y A033501 Sequence in context: A036407 A145807 A122380 this_sequence A097273 A006446 
               A002348
%Y A033501 Adjacent sequences: A033498 A033499 A033500 this_sequence A033502 A033503 
               A033504
%K A033501 nonn,easy
%O A033501 1,2
%A A033501 Greg Martin (gerg(AT)alumni.stanford.org); suggested by Jon Grantham.

    
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 6 13:45 EST 2009. Contains 170429 sequences.


AT&T Labs Research