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.

A000062 A Beatty sequence: a(n) = floor(n/(e-2)).

Original entry on oeis.org

1, 2, 4, 5, 6, 8, 9, 11, 12, 13, 15, 16, 18, 19, 20, 22, 23, 25, 26, 27, 29, 30, 32, 33, 34, 36, 37, 38, 40, 41, 43, 44, 45, 47, 48, 50, 51, 52, 54, 55, 57, 58, 59, 61, 62, 64, 65, 66, 68, 69, 71, 72, 73, 75, 76, 77, 79, 80, 82, 83, 84, 86, 87, 89, 90, 91, 93, 94, 96, 97, 98
Offset: 1

Views

Author

Keywords

References

  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Cf. A194807 (1/(e-2)).

Programs

  • Magma
    [Floor( n/(Exp(1)-2) ): n in [1..80]]; // Vincenzo Librandi, Mar 27 2015
  • Maple
    for n from 1 to 200 do printf(`%d,`,floor( n/(exp(1)-2))) od:
  • Mathematica
    Table[Floor[n/(E-2)],{n,100}] (* Vladimir Joseph Stephan Orlovsky, Jan 24 2012 *)
  • PARI
    a(n)=floor( n/(exp(1)-2) ) \\ Hauke Worpel (thebigh(AT)outgun.com), Jun 11 2008
    

Extensions

More terms from James Sellers, Feb 19 2001