login
This site is supported by donations 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)). 1
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; internal format)
OFFSET

0,3

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.

CROSSREFS

Cf. A137734.

Sequence in context: A096004 A193495 A071068 * A143966 A178695 A029363

Adjacent sequences:  A137732 A137733 A137734 * A137736 A137737 A137738

KEYWORD

easy,nonn

AUTHOR

Leroy Quet, Feb 09 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:21 EST 2012. Contains 205907 sequences.