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.

A085006 Let S(0)={1,1,2} S(n)={S(n-1), S(n-1)-{x},{3-x}} where x is the last element of S(n-1), then sequence is S(infinity).

Original entry on oeis.org

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

Views

Author

Benoit Cloitre, Jun 17 2003

Keywords

Comments

A fractal sequence.

Crossrefs

Cf. A085007, A085008, A085009.

A085007 Partial sums of A085006.

Original entry on oeis.org

1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 13, 15, 16, 17, 19, 20, 21, 22, 23, 24, 26, 27, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 40, 41, 42, 44, 45, 46, 48, 49, 50, 51, 52, 53, 55, 56, 57, 59, 60, 61, 63, 64, 65, 66, 67, 68, 70, 71, 72, 74, 75, 76, 78, 79, 80, 81, 82, 83, 85, 86, 87, 88
Offset: 1

Views

Author

Benoit Cloitre, Jun 17 2003

Keywords

Crossrefs

Cf. A085006, A085008, A085009.

A085008 a(n)=9*A085007(n)-11*n.

Original entry on oeis.org

-2, -4, 3, 1, -1, -3, -5, -7, 0, -2, -4, 3, 1, -1, 6, 4, 2, 0, -2, -4, 3, 1, -1, -3, -5, -7, 0, -2, -4, -6, -8, -10, -3, -5, -7, 0, -2, -4, 3, 1, -1, -3, -5, -7, 0, -2, -4, 3, 1, -1, 6, 4, 2, 0, -2, -4, 3, 1, -1, 6, 4, 2, 9, 7, 5, 3, 1, -1, 6, 4, 2, 0, -2, -4, 3, 1, -1, -3, -5, -7, 0, -2, -4, 3, 1, -1, 6, 4, 2, 0, -2, -4, 3, 1, -1, -3, -5, -7, 0, -2, -4
Offset: 1

Views

Author

Benoit Cloitre, Jun 17 2003

Keywords

Crossrefs

Cf. A085006, A085007, A085009.
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.