Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #24 Jul 05 2024 17:20:15
%S 7,15,23,31,39,47,55,63,71,79,87,94,102,110,118,126,134,142,150,158,
%T 166,174,181,189,197,205,213,221,229,237,245,253,261,268,276,284,292,
%U 300,308,316,324,332,340,348,355,363,371,379,387,395,403,411,419,427
%N Beatty sequence for log(Pi)/(log(Pi)-1).
%H Harry J. Smith, <a href="/A059562/b059562.txt">Table of n, a(n) for n = 1..2000</a>
%H Aviezri S. Fraenkel, Jonathan Levitt and 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 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/(A053510 - 1))). - _Paolo Xausa_, Jul 05 2024
%t Floor[Range[100]*(1 + 1/(Log[Pi] - 1))] (* _Paolo Xausa_, Jul 05 2024 *)
%o (PARI) { default(realprecision, 100); b=log(Pi)/(log(Pi) - 1); for (n = 1, 2000, write("b059562.txt", n, " ", floor(n*b)); ) } \\ _Harry J. Smith_, Jun 28 2009
%o (PARI) A059562(n,c=1-1/log(Pi))=n\c \\ Use \pXX to set sufficiently large precision. - _M. F. Hasler_, Oct 06 2014
%Y Beatty complement is A059561.
%Y Cf. A053510.
%K nonn,easy
%O 1,1
%A _Mitch Harris_, Jan 22 2001