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 #40 Jul 05 2024 17:14:25
%S 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 29,30,32,33,34,35,36,37,38,40,41,42,43,44,45,46,48,49,50,51,52,53,54,
%U 56,57,58,59,60,61,62,64,65,66,67,68,69,70,72,73,74,75,76,77,78,80,81
%N Beatty sequence for log(Pi).
%C a(n) is the largest integer m such that e^m < Pi^n. - _Stanislav Sykora_, May 29 2015
%H Harry J. Smith, <a href="/A059561/b059561.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) = A004777(n+1), 1 <= n < 83. - _R. J. Mathar_, Oct 05 2008
%F a(n) = floor(n*log(Pi)). - _Michel Marcus_, Jan 04 2015
%t Floor[Range[100]*Log[Pi]] (* _Paolo Xausa_, Jul 05 2024 *)
%o (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 Beatty complement is A059562.
%Y Cf. A000796 (Pi), A001113 (e), A053510 (log(Pi)).
%Y Cf. A022932 (characteristic function).
%K nonn,easy
%O 1,2
%A _Mitch Harris_, Jan 22 2001