cp's OEIS Frontend

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.

A059557 Beatty sequence for 1 + gamma^2, (gamma is the Euler-Mascheroni constant A001620).

This page as a plain text file.
%I A059557 #23 Feb 16 2025 08:32:44
%S A059557 1,2,3,5,6,7,9,10,11,13,14,15,17,18,19,21,22,23,25,26,27,29,30,31,33,
%T A059557 34,35,37,38,39,41,42,43,45,46,47,49,50,51,53,54,55,57,58,59,61,62,63,
%U A059557 65,66,67,69,70,71,73,74,75,77,78,79,81,82,83,85,86,87,89,90,91,93,94
%N A059557 Beatty sequence for 1 + gamma^2, (gamma is the Euler-Mascheroni constant A001620).
%H A059557 Harry J. Smith, <a href="/A059557/b059557.txt">Table of n, a(n) for n = 1..2000</a>
%H A059557 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 A059557 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence.</a>
%H A059557 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F A059557 a(n) = A042968(n-1), 1<=n<2146. - _R. J. Mathar_, Oct 05 2008
%t A059557 Table[Floor[(1 + EulerGamma^2)*n], {n,1,100}] (* _G. C. Greubel_, Aug 27 2018 *)
%o A059557 (PARI) { default(realprecision, 100); b=1 + Euler^2; for (n = 1, 2000, write("b059557.txt", n, " ", floor(n*b)); ) } \\ _Harry J. Smith_, Jun 28 2009
%o A059557 (Magma) R:=RealField(100); [Floor((1+EulerGamma(R)^2)*n): n in [1..100]]; // _G. C. Greubel_, Aug 27 2018
%Y A059557 Beatty complement is A059558.
%K A059557 nonn,easy
%O A059557 1,2
%A A059557 _Mitch Harris_, Jan 22 2001