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.

A038129 Beatty sequence for cube root of 2.

Original entry on oeis.org

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, 31, 32, 34, 35, 36, 37, 39, 40, 41, 42, 44, 45, 46, 47, 49, 50, 51, 52, 54, 55, 56, 57, 59, 60, 61, 62, 64, 65, 66, 68, 69, 70, 71, 73, 74, 75, 76, 78, 79, 80, 81, 83, 84, 85, 86, 88, 89
Offset: 0

Views

Author

Keywords

Crossrefs

Cf. A059539.

Programs

  • Mathematica
    Floor[Range[0,90]Surd[2,3]] (* Harvey P. Dale, Mar 24 2019 *)
  • PARI
    a(n)=floor(n*2^(1/3))
    
  • Python
    from sympy import integer_nthroot
    def A038129(n): return integer_nthroot(2*n**3,3)[0] # Chai Wah Wu, Mar 17 2021

Formula

a(n)=floor(n*1.2599210498..)
a(n)=floor(n*2^(1/3)) - Benoit Cloitre, Apr 16 2003

Extensions

More terms from Benoit Cloitre, Apr 16 2003