login

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”).

Beatty sequence for 1 + Pi.
2

%I #25 Jul 05 2024 07:18:30

%S 4,8,12,16,20,24,28,33,37,41,45,49,53,57,62,66,70,74,78,82,86,91,95,

%T 99,103,107,111,115,120,124,128,132,136,140,144,149,153,157,161,165,

%U 169,173,178,182,186,190,194,198,202,207,211,215,219,223,227,231,236

%N Beatty sequence for 1 + Pi.

%H Harry J. Smith, <a href="/A059532/b059532.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 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>

%t Floor[Range[100]*(1 + Pi)] (* _Paolo Xausa_, Jul 05 2024 *)

%o (PARI) { default(realprecision, 100); b=1 + Pi; for (n = 1, 2000, write("b059532.txt", n, " ", floor(n*b)); ) } \\ _Harry J. Smith_, Jun 27 2009

%Y Beatty complement is A059531.

%K nonn,easy

%O 1,1

%A _Mitch Harris_, Jan 22 2001