|
%I #30 Sep 29 2023 07:02:52
%S 4,8,12,16,20,24,28,32,36,40,44,48,52,56,60,64,68,72,76,80,84,88,92,
%T 96,100,104,108,112,116,120,124,128,132,136,140,144,148,152,156,160,
%U 164,168,172,176,180,184,188,192,196,200,204,208,212,216,220,224,228
%N Beatty sequence for 1 + 1/gamma^2.
%C The first term where this sequence breaks the progression a(n) = a(n-1) + 4 is a(715) = 2861. - _Max Alekseyev_, Mar 03 2007
%H Harry J. Smith, <a href="/A059558/b059558.txt">Table of n, a(n) for n = 1..2000</a>
%H Aviezri S. Fraenkel, Jonathan Levitt, Michael Shimshoni, <a href="http://dx.doi.org/10.1016/0012-365X(72)90012-X">Characterization of the set of values f(n)=[n alpha], n=1,2,...</a>, Discrete Math. 2 (1972), no.4, 335-345.
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/NonRecursions.html">Non Recursions</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence.</a>
%H <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F a(n) = floor(n*(1+1/gamma^2)) where 1+1/gamma^2= 1+A098907^2 = 4.00139933... - _R. J. Mathar_, Sep 29 2023
%o (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
%Y Beatty complement is A059557.
%K nonn,easy
%O 1,1
%A _Mitch Harris_, Jan 22 2001
%E Removed incorrect comment, _Joerg Arndt_, Nov 14 2014
|
