Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137734
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A137734
%S A137734 1,1,2,2,2,3,2,3,3,3,4,3,3,4,4,4,4,5,4,4,4,5,5,5,5,5,6,5,5,5,5,6,6,6,6,
%T A137734 6,6,7,6,6,6,6,6,7,7,7,7,7,7,7,8,7,7,7,7,7,7,8,8,8,8,8,8,8,8,9,8,8,8,8,
%U A137734 8,8,8,9,9,9,9,9,9,9,9,9,10,9,9,9,9,9,9,9,9,10,10,10,10,10,10,10,10,10
%N A137734 a(0)=1. a(n) = ceiling(n/b(n)), where b(n) is the largest value among 
               (a(0),a(1),...,a(n-1)).
%H A137734 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%F A137734 For all m>=2, a(k) = m if m^2-m+1 <= k <= m^2, a(m^2 +1) = m+1, a(k) 
               = m if m^2 +2 <= k <= m^2 +m.
%e A137734 The largest value among terms a(0) through a(12) is 4. So a(13) = ceiling(13/
               4) = 4.
%Y A137734 Cf. A137735.
%Y A137734 Sequence in context: A128330 A133801 A112310 this_sequence A078705 A050331 
               A128435
%Y A137734 Adjacent sequences: A137731 A137732 A137733 this_sequence A137735 A137736 
               A137737
%K A137734 easy,nonn
%O A137734 0,3
%A A137734 Leroy Quet Feb 09 2008

    
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 5 08:23 EST 2009. Contains 170348 sequences.


AT&T Labs Research