OFFSET
1,1
COMMENTS
The first term where this sequence breaks the progression a(n) = a(n-1) + 4 is a(715) = 2861. - Max Alekseyev, Mar 03 2007
LINKS
Harry J. Smith, Table of n, a(n) for n = 1..2000
Aviezri S. Fraenkel, Jonathan Levitt, Michael Shimshoni, Characterization of the set of values f(n)=[n alpha], n=1,2,..., Discrete Math. 2 (1972), no.4, 335-345.
Tanya Khovanova, Non Recursions
Eric Weisstein's World of Mathematics, Beatty Sequence.
FORMULA
a(n) = floor(n*(1+1/gamma^2)) where 1+1/gamma^2= 1+A098907^2 = 4.00139933... - R. J. Mathar, Sep 29 2023
MATHEMATICA
Floor[Range[100]*(1 + 1/EulerGamma^2)] (* Paolo Xausa, Jul 05 2024 *)
PROG
(PARI) { default(realprecision, 100); b=1 + 1/Euler^2; for (n = 1, 2000, write("b059558.txt", n, " ", floor(n*b)); ) } \\ Harry J. Smith, Jun 28 2009
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Mitch Harris, Jan 22 2001
EXTENSIONS
Removed incorrect comment, Joerg Arndt, Nov 14 2014
STATUS
approved