A038127 A Beatty sequence: a(n) = floor(n*2^sqrt(2)).

0, 2, 5, 7, 10, 13, 15, 18, 21, 23, 26, 29, 31, 34, 37, 39, 42, 45, 47, 50, 53, 55, 58, 61, 63, 66, 69, 71, 74, 77, 79, 82, 85, 87, 90, 93, 95, 98, 101, 103, 106, 109, 111, 114, 117, 119, 122, 125, 127, 130, 133, 135, 138, 141, 143, 146, 149, 151

Offset: 0

Author

Felice Russo

Keywords

• nonn

Comments

2^sqrt(2) is the Hilbert number (a.k.a. Gelfond-Schneider constant) (A007507).

Of course this is different from A047480.

Links

• G. C. Greubel, Table of n, a(n) for n = 0..10000
• Wikipedia, Hilbert number
• Index entries for sequences related to Beatty sequences

Programs

Magma

[Floor(n*2^(Sqrt(2))): n in [1..50]]; // G. C. Greubel, Mar 27 2018

Mathematica

Floor[2^Sqrt[2] Range[0,60]] (* Harvey P. Dale, Dec 03 2012 *)

PARI

for(n=1,50, print1(floor(n*2^(sqrt(2))), ", ")) \\ G. C. Greubel, Mar 27 2018