The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A043551 Least k for which the integers Floor(4k/m) for m=2,3,...,n are distinct. 0
 1, 1, 1, 3, 3, 4, 5, 9, 11, 14, 16, 23, 25, 31, 33, 39, 46, 49, 60, 64, 68, 81, 86, 95, 105, 116, 121, 138, 144, 157, 169, 183, 189, 203, 218, 233, 248, 256, 281, 289, 307, 324, 333, 361, 371, 390, 410, 431, 452, 473, 484, 518, 529 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS MATHEMATICA lkid[n_]:=Module[{k=1}, While[Max[Tally[Floor[(4k)/Range[2, n]]][[All, 2]]]> 1, k++]; k]; Array[lkid, 60] (* Harvey P. Dale, Jun 18 2018 *) CROSSREFS Sequence in context: A239483 A104806 A241442 * A162888 A151759 A008443 Adjacent sequences:  A043548 A043549 A043550 * A043552 A043553 A043554 KEYWORD nonn AUTHOR STATUS approved

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

Last modified January 21 21:30 EST 2020. Contains 331128 sequences. (Running on oeis4.)