This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A059543 #26 Feb 16 2025 08:32:44 %S A059543 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 A059543 29,30,31,32,34,35,36,37,38,39,40,41,42,43,45,46,47,48,49,50,51,52,53, %U A059543 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 A059543 Beatty sequence for log(3). %C A059543 Differs from A160542 at indices n=81, 91, 101, 111, 121, 131, 141, 151, 152, 161 etc. - _R. J. Mathar_, May 20 2009 %H A059543 Harry J. Smith, <a href="/A059543/b059543.txt">Table of n, a(n) for n = 1..2000</a> %H A059543 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 A059543 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence.</a> %H A059543 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a> %F A059543 a(n) = floor(n*A002391). - _Paolo Xausa_, Jul 05 2024 %p A059543 A059543 := proc(n) %p A059543 floor(n*log(3)) ; %p A059543 end proc: %p A059543 seq(A059543(n),n=1..100) ; # _R. J. Mathar_, Jun 26 2023 %t A059543 Floor[Range[100]*Log[3]] (* _Paolo Xausa_, Jul 05 2024 *) %o A059543 (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 A059543 Beatty complement is A059544. %Y A059543 Cf. A002391 (log(3)). %Y A059543 Cf. A160542. %K A059543 nonn,easy %O A059543 1,2 %A A059543 _Mitch Harris_, Jan 22 2001