A183138 a(n) = floor(n/(2+sqrt(2))).

0, 0, 0, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 16, 16, 16, 16, 17, 17, 17, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20

Offset: 1

Author

Clark Kimberling, Dec 26 2010

Keywords

• nonn

Comments

A083051(n) = 2*n+1 + floor(n*sqrt(2)) is the location of the least k for which a(k)=n.

Links

• G. C. Greubel, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A183140. Beatty sequence of A268682.

Programs

Magma

[Floor(n/(2+Sqrt(2))): n in [1..100]]; // G. C. Greubel, Apr 10 2018

Mathematica

With[{c=2+Sqrt[2]},Table[Floor[n/c],{n,80}]] (* Harvey P. Dale, Jun 21 2017 *)

PARI

for(n=1,100, print1(floor(n/(2+sqrt(2))), ", ")) \\ G. C. Greubel Apr 10 2018

Formula

a(n) = floor(n/(2+sqrt(2))).