A103128 a(n) = floor(sqrt(2n-1)).

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

Offset: 1

Author

Giovanni Teofilatto, Mar 17 2005

Keywords

• easy
• nonn

Comments

n appears 2 * ceiling(n/2) times.

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A172471, A000196, A005408, A007590.

Programs

Haskell

a103128 = a000196 . (subtract 1) . (* 2)
-- Reinhard Zumkeller, Feb 12 2012

Maple

seq(floor(sqrt(2*n-1)), n=1..100); # Robert Israel, Sep 12 2016

Mathematica

Table[Floor[Sqrt[2n-1]],{n,100}] (* Mohammad K. Azarian, Jun 15 2016 *)

Formula

From Robert Israel, Sep 12 2016: (Start)

a(n+1) = a(n)+1 for n in A007590, otherwise a(n+1) = a(n).

G.f.: x*Theta3(x^2)/(2*(1-x)) + sqrt(x)*Theta2(x^2)/(2*(1-x)) - x/(2*(1-x)), where Theta2 and Theta3 are Jacobi Theta functions. (End)

Extensions

Edited by Franklin T. Adams-Watters, Apr 20 2010

New name from Wesley Ivan Hurt, Nov 26 2020