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.

A000210 A Beatty sequence: floor(n*(e-1)).

Original entry on oeis.org

1, 3, 5, 6, 8, 10, 12, 13, 15, 17, 18, 20, 22, 24, 25, 27, 29, 30, 32, 34, 36, 37, 39, 41, 42, 44, 46, 48, 49, 51, 53, 54, 56, 58, 60, 61, 63, 65, 67, 68, 70, 72, 73, 75, 77, 79, 80, 82, 84, 85, 87, 89, 91, 92, 94, 96, 97, 99, 101, 103, 104, 106, 108, 109, 111, 113, 115, 116
Offset: 1

Views

Author

Keywords

Comments

The first 38 terms coincide with the corresponding terms of A082977, i.e., numbers that are congruent to {0, 1, 3, 5, 6, 8, 10} mod 12. - Giovanni Resta, Mar 24 2006

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).

Programs

  • Maple
    a:= n-> floor (n*(exp(1)-1)): seq (a(n), n=1..200); # Alois P. Heinz, Aug 25 2008
  • Mathematica
    Table[Floor[n*(E - 1)], {n, 0, 100}] (* T. D. Noe, Jan 21 2013 *)

Extensions

More terms from James Sellers, Jul 06 2000