This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036576 a(n) is the least number not of the form floor(k^2/n). 0
 2, 1, 2, 3, 2, 3, 4, 5, 3, 5, 6, 7, 5, 6, 7, 8, 6, 7, 9, 10, 7, 9, 10, 11, 8, 10, 11, 13, 10, 11, 13, 14, 11, 13, 14, 15, 12, 14, 15, 17, 13, 15, 17, 18, 14, 16, 18, 19, 15, 17, 19, 21, 17, 19, 20, 22, 18, 20, 22, 23, 19, 21, 23, 24, 20, 22, 24, 26, 21, 23, 25, 27, 22, 25, 26, 28 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n) = floor(m + n + 2*sqrt(m*n - 1))/4) where m = ((n-1) mod 4) + 1. CROSSREFS Sequence in context: A070086 A211990 A162618 * A171729 A127255 A174832 Adjacent sequences:  A036573 A036574 A036575 * A036577 A036578 A036579 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 December 15 00:30 EST 2019. Contains 329988 sequences. (Running on oeis4.)