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 A038129 #16 Mar 17 2021 19:48:23 %S A038129 0,1,2,3,5,6,7,8,10,11,12,13,15,16,17,18,20,21,22,23,25,26,27,28,30, %T A038129 31,32,34,35,36,37,39,40,41,42,44,45,46,47,49,50,51,52,54,55,56,57,59, %U A038129 60,61,62,64,65,66,68,69,70,71,73,74,75,76,78,79,80,81,83,84,85,86,88,89 %N A038129 Beatty sequence for cube root of 2. %H A038129 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a> %F A038129 a(n)=floor(n*1.2599210498..) %F A038129 a(n)=floor(n*2^(1/3)) - _Benoit Cloitre_, Apr 16 2003 %t A038129 Floor[Range[0,90]Surd[2,3]] (* _Harvey P. Dale_, Mar 24 2019 *) %o A038129 (PARI) a(n)=floor(n*2^(1/3)) %o A038129 (Python) %o A038129 from sympy import integer_nthroot %o A038129 def A038129(n): return integer_nthroot(2*n**3,3)[0] # _Chai Wah Wu_, Mar 17 2021 %Y A038129 Cf. A059539. %K A038129 nonn %O A038129 0,3 %A A038129 _Felice Russo_ %E A038129 More terms from _Benoit Cloitre_, Apr 16 2003