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 log(3).
4

%I #25 Jul 05 2024 09:25:50

%S 1,2,3,4,5,6,7,8,9,10,12,13,14,15,16,17,18,19,20,21,23,24,25,26,27,28,

%T 29,30,31,32,34,35,36,37,38,39,40,41,42,43,45,46,47,48,49,50,51,52,53,

%U 54,56,57,58,59,60,61,62,63,64,65,67,68,69,70,71,72,73,74,75,76,78,79,80,81,82,83,84,85,86,87,88,90,91,92,93,94,95,96

%N Beatty sequence for log(3).

%C Differs from A160542 at indices n=81, 91, 101, 111, 121, 131, 141, 151, 152, 161 etc. - _R. J. Mathar_, May 20 2009

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

%F a(n) = floor(n*A002391). - _Paolo Xausa_, Jul 05 2024

%p A059543 := proc(n)

%p floor(n*log(3)) ;

%p end proc:

%p seq(A059543(n),n=1..100) ; # _R. J. Mathar_, Jun 26 2023

%t Floor[Range[100]*Log[3]] (* _Paolo Xausa_, Jul 05 2024 *)

%o (PARI) { default(realprecision, 100); b=log(3); for (n = 1, 2000, write("b059543.txt", n, " ", floor(n*b)); ) } \\ _Harry J. Smith_, Jun 28 2009

%Y Beatty complement is A059544.

%Y Cf. A002391 (log(3)).

%Y Cf. A160542.

%K nonn,easy

%O 1,2

%A _Mitch Harris_, Jan 22 2001