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!)
A331953 a(n) is the least positive k such that floor(n/k) is a square number. 4
1, 1, 2, 2, 1, 3, 4, 4, 2, 1, 6, 6, 3, 3, 3, 8, 1, 4, 2, 2, 5, 5, 5, 5, 5, 1, 6, 3, 3, 3, 7, 7, 2, 2, 7, 8, 1, 4, 4, 4, 9, 9, 9, 9, 9, 5, 5, 5, 3, 1, 2, 2, 11, 11, 6, 6, 6, 6, 6, 6, 13, 13, 13, 7, 1, 4, 4, 4, 7, 7, 15, 15, 2, 2, 8, 3, 3, 3, 8, 8, 5, 1, 5, 5, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
This sequence is unbounded; a(n!*p) > n where p is a prime number > n.
LINKS
FORMULA
a(n^2) = 1.
a(2*n^2) = 2 for any n > 0.
EXAMPLE
For n = 12:
- floor(13/1) = 13 is not a square number,
- floor(13/2) = 6 is not a square number,
- floor(13/3) = 4 is a square number,
- hence a(13) = 3.
MATHEMATICA
Array[Block[{k = 1}, While[! IntegerQ@ Sqrt@ Floor[#/k], k++]; k] &, 85, 0] (* Michael De Vlieger, Feb 04 2020 *)
PROG
(PARI) a(n) = for (k=1, oo, if (issquare(n\k), return (k)))
CROSSREFS
Cf. A331954 (prime variant), A331958 (corresponding square roots), A332012 (corresponding squares).
Sequence in context: A216368 A123956 A368606 * A113594 A368604 A246425
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Feb 02 2020
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 25 11:06 EDT 2024. Contains 371967 sequences. (Running on oeis4.)