A079643 a(n) = floor(n/floor(sqrt(n))).

1, 2, 3, 2, 2, 3, 3, 4, 3, 3, 3, 4, 4, 4, 5, 4, 4, 4, 4, 5, 5, 5, 5, 6, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 9, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11

Offset

1,2

Comments

a(n) > a(n+1) iff n = m^2 - 1 with m >= 2; that is the answer to the 4th problem of the 32nd British Mathematical Olympiad (1996) [See link BMO]. - Bernard Schott, Oct 28 2019

References

A. Gardiner, The Mathematical Olympiad Handbook: An Introduction to Problem Solving, Oxford University Press, 1997, reprinted 2011, Pb 4 pp. 54 and 92-93 (1996).

Links

Giovanni Resta, Table of n, a(n) for n = 1..10000

British Mathematical Olympiad, 1996 - Problem 4

Index to sequences related to Olympiads.

Formula

a(A064801(n)) = sqrtint(A064801(n)); a(A005563(n)) = 2+sqrtint(sqrt(A005563(n))).

For m = positive integer, terms a(m^2) through a(m^2+m-1) each equal m; terms a(m^2+m) through a(m^2+2m-1) each equal m+1; term a(m^2+2m) equals m+2. - Leroy Quet, Apr 02 2007

a(n) = floor(2*sqrt(n+1)) - floor(sqrt(n)). - Wesley Ivan Hurt, Dec 25 2020

Mathematica

Table[Floor[n/Floor[Sqrt[n]]], {n, 100}] (* Harvey P. Dale, Sep 22 2011 *)

Prog

(PARI) a(n)=floor(n/sqrtint(n))

Crossrefs

Cf. A000196, A005563, A064801.

Sequence in context: A366712 A366713 A076733 * A329317 A118480 A104377

Adjacent sequences: A079640 A079641 A079642 * A079644 A079645 A079646

Keyword

nonn,easy

Author

Benoit Cloitre, Jan 31 2003

Status

approved