Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046805
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A046805
%S A046805 1,1,1,2,1,2,1,2,3,2,1,3,2,2,3,4,2,3,2,4,3,2,2,4,5,2,3,4,3,5,3,4,3,3,5,
%T A046805 6,3,3,3,5,4,6,3,4,5,4,3,6,7,5,4,4,4,6,5,7,4,4,4,6,5,4,7,8,5,6,5,4,4,7,
%U A046805 5,8,5,5,5,5,7,6,5,8,9,5,5,7,6,5,5,8,5,9,7,6,5,5,5,8,6,7,9,10,5,6,6,8
%N A046805 If n=sum a_i b_i, (a_i,b_i positive integers) then a(n)=max value of 
               min(all a_i and b_i).
%e A046805 a(13)=2 since 13=2*2+3*3.
%Y A046805 Sequence in context: A059981 A033676 A095165 this_sequence A034880 A070966 
               A072504
%Y A046805 Adjacent sequences: A046802 A046803 A046804 this_sequence A046806 A046807 
               A046808
%K A046805 easy,nice,nonn
%O A046805 1,4
%A A046805 Erich Friedman (erich.friedman(AT)stetson.edu)

    
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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research