login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137735 a(0)=1. a(n) = floor(n/b(n)), where b(n) is the largest value among (a(0),a(1),...,a(n-1)). 2
1, 1, 2, 1, 2, 2, 3, 2, 2, 3, 3, 3, 4, 3, 3, 3, 4, 4, 4, 4, 5, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Length of n-th run appears to be A103627(n + 2) for n > 1. - Peter Kagey, Apr 25 2016
LINKS
FORMULA
For all m>=1, a(k) = m if m^2 <= k <= m^2 +m-1, a(m^2 +m) = m+1, a(k) = m if m^2 +m+1 <= k <= m^2 +2m.
EXAMPLE
The largest value among terms a(0) through a(14) is 4. So a(15) = floor(15/4) = 3.
MATHEMATICA
a = {1}; Do[AppendTo[a, Floor[n/Max@ a]], {n, 2, 120}]; {1}~Join~a (* Michael De Vlieger, Apr 25 2016 *)
CROSSREFS
Sequence in context: A240872 A328806 A326370 * A365576 A290983 A272887
KEYWORD
easy,nonn
AUTHOR
Leroy Quet, Feb 09 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)