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.

Showing 1-3 of 3 results.

A083056 a(n) = 3*A083055(n)-n.

Original entry on oeis.org

2, 1, 0, -1, -2, 0, -1, 1, 0, -1, 1, 0, 2, 1, 3, 2, 1, 3, 2, 4, 3, 2, 1, 0, 2, 1, 3, 2, 1, 0, -1, 1, 0, 2, 1, 0, 2, 1, 3, 2, 1, 0, -1, 1, 0, 2, 1, 0, -1, -2, 0, -1, 1, 0, -1, -2, -3, -1, -2, 0, -1, -2, 0, -1, 1, 0, -1, -2, -3, -1, -2, 0, -1, -2, -3, -4, -2, -3, -1, -2, -3, -1, -2, 0, -1, 1, 0, -1, 1, 0, 2, 1, 0, -1, -2, 0, -1, 1, 0, -1, -2, -3, -1, -2, 0
Offset: 1

Views

Author

Benoit Cloitre, Apr 18 2003

Keywords

Links

Crossrefs

Cf. A083038, A083054, A083055, A083057.

A083057 A fractal sequence.

Original entry on oeis.org

2, 3, 3, 2, 0, 0, -1, 0, 0, -1, 0, 0, 2, 3, 6, 8, 9, 12, 14, 18, 21, 23, 24, 24, 26, 27, 30, 32, 33, 33, 32, 33, 33, 35, 36, 36, 38, 39, 42, 44, 45, 45, 44, 45, 45, 47, 48, 48, 47, 45, 45, 44, 45, 45, 44, 42, 39, 38, 36, 36, 35, 33, 33, 32, 33, 33, 32, 30, 27, 26, 24, 24, 23, 21, 18, 14, 12, 9, 8, 6, 3, 2, 0, 0, -1, 0, 0, -1, 0, 0, 2, 3, 3, 2, 0
Offset: 1

Views

Author

Benoit Cloitre, Apr 18 2003

Keywords

Links

Crossrefs

Cf. A083038, A083054, A083055, A083056.

Formula

a(n)=sum(k=1, n, A083056(k))

A083054 a(n) = floor(sqrt(3)*n) - 3*floor(n/sqrt(3)).

Original entry on oeis.org

1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 1, 2, 1, 0, 1, 0, 2, 1, 2, 1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 1, 2, 1, 0, 2, 0, 2, 1, 2, 1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 1, 2, 1, 0, 2, 0, 2, 1, 2, 1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 1, 2, 1, 0, 1, 0, 2, 1, 2, 1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 0, 2, 1, 0, 1
Offset: 1

Views

Author

Benoit Cloitre, Apr 18 2003

Keywords

Links

Crossrefs

Cf. A083035, A083038, A083055, A083056, A083057.
Cf. A022383 (floor(n*sqrt(3))).

Programs

  • PARI
    {a(n)=if(n<1, 0, sqrtint(3*n^2)-3*sqrtint(n^2\3))} /* Michael Somos, Aug 31 2006 */

Formula

a(n) = floor(n*sqrt(3)) mod 3. - T. D. Noe, Oct 11 2006
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.