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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A183572 a(n) = n + floor(sqrt(2*n-1)). 1
 2, 3, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 85, 86, 87, 88, 89, 90, 91, 92 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..10000 Steve Butler and Jia Mao, Problem 11265, Amer. Math. Monthly 114, (2007), p77. MATHEMATICA Table[n + Floor[Sqrt[2 n - 1]], {n, 100}] (* Vincenzo Librandi, Feb 18 2017 *) PROG (MAGMA) [n+Floor(Sqrt(2*n-1)): n in [1..80]]; // Vincenzo Librandi, Feb 18 2017 (PARI) a(n) = n + sqrtint(2*n-1); \\ Michel Marcus, Feb 18 2017 CROSSREFS Cf. A074148 (complement), A103128. Sequence in context: A039143 A039104 A184861 * A285962 A047450 A039073 Adjacent sequences:  A183569 A183570 A183571 * A183573 A183574 A183575 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jan 05 2011 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 June 13 04:23 EDT 2021. Contains 344980 sequences. (Running on oeis4.)