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 A059561 #41 Feb 16 2025 08:32:44
%S A059561 1,2,3,4,5,6,8,9,10,11,12,13,14,16,17,18,19,20,21,22,24,25,26,27,28,
%T A059561 29,30,32,33,34,35,36,37,38,40,41,42,43,44,45,46,48,49,50,51,52,53,54,
%U A059561 56,57,58,59,60,61,62,64,65,66,67,68,69,70,72,73,74,75,76,77,78,80,81
%N A059561 Beatty sequence for log(Pi).
%C A059561 a(n) is the largest integer m such that e^m < Pi^n. - _Stanislav Sykora_, May 29 2015
%H A059561 Harry J. Smith, <a href="/A059561/b059561.txt">Table of n, a(n) for n = 1..2000</a>
%H A059561 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 A059561 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence.</a>
%H A059561 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F A059561 a(n) = A004777(n+1), 1 <= n < 83. - _R. J. Mathar_, Oct 05 2008
%F A059561 a(n) = floor(n*log(Pi)). - _Michel Marcus_, Jan 04 2015
%t A059561 Floor[Range[100]*Log[Pi]] (* _Paolo Xausa_, Jul 05 2024 *)
%o A059561 (PARI) { default(realprecision, 100); b=log(Pi); for (n = 1, 2000, write("b059561.txt", n, " ", floor(n*b)); ) } \\ _Harry J. Smith_, Jun 28 2009
%Y A059561 Beatty complement is A059562.
%Y A059561 Cf. A000796 (Pi), A001113 (e), A053510 (log(Pi)).
%Y A059561 Cf. A022932 (characteristic function).
%K A059561 nonn,easy
%O A059561 1,2
%A A059561 _Mitch Harris_, Jan 22 2001