A183138 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,7

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

FORMULA

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

MATHEMATICA

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

PROG

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

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

CROSSREFS

Cf. A183140. Beatty sequence of A268682.

Sequence in context: A057356 A172274 A350843 * A020913 A025787 A057810

Adjacent sequences: A183135 A183136 A183137 * A183139 A183140 A183141

KEYWORD

nonn

AUTHOR

Clark Kimberling, Dec 26 2010

STATUS

approved