The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A038127 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A038127

A Beatty sequence: a(n) = floor(n*2^sqrt(2)).
(history; published version)

#30 by N. J. A. Sloane at Tue Jan 31 08:39:06 EST 2023

STATUS

editing

approved

#29 by N. J. A. Sloane at Tue Jan 31 08:39:01 EST 2023

COMMENTS

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

STATUS

proposed

editing

#28 by Lorenzo Sauras Altuzarra at Wed Jan 25 13:07:07 EST 2023

STATUS

editing

proposed

#27 by Lorenzo Sauras Altuzarra at Wed Jan 25 13:06:54 EST 2023

NAME

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

COMMENTS

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

STATUS

approved

editing

#26 by Charles R Greathouse IV at Thu Sep 08 08:44:53 EDT 2022

PROG

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

Discussion

Thu Sep 08

08:44

OEIS Server: https://oeis.org/edit/global/2944

#25 by Bruno Berselli at Wed Mar 28 05:19:50 EDT 2018

STATUS

proposed

approved

#24 by G. C. Greubel at Wed Mar 28 00:54:02 EDT 2018

STATUS

editing

proposed

#23 by G. C. Greubel at Wed Mar 28 00:51:52 EDT 2018

NAME

Floora(n) = floor(n*2^sqrt(2)).

LINKS

G. C. Greubel, <a href="/A038127/b038127.txt">Table of n, a(n) for n = 0..10000</a>

PROG

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

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

AUTHOR

Felice Russo.

STATUS

approved

editing

#22 by Joerg Arndt at Sun Apr 24 11:49:08 EDT 2016

STATUS

editing

approved

#21 by Andrew Howroyd at Sun Apr 24 11:46:16 EDT 2016

LINKS

Wikipedia, <a href="http://en.wikipedia.org/wiki/Hilbert_number">Hilbert number</refa>

STATUS

approved

editing