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.

A160051 Lodumo_2 of Kolakoski sequence (A000002).

Original entry on oeis.org

1, 0, 2, 3, 5, 4, 7, 6, 8, 9, 10, 12, 11, 13, 14, 15, 17, 16, 18, 19, 20, 21, 23, 22, 25, 24, 26, 27, 29, 28, 31, 33, 30, 35, 32, 34, 37, 36, 38, 39, 41, 40, 43, 42, 44, 45, 46, 47, 49, 48, 51, 53, 50, 52, 55, 54, 56, 57, 59, 58, 61, 60, 62, 63, 64, 66, 65, 67, 68, 69, 71, 70, 73
Offset: 0

Views

Author

Philippe Deléham, Apr 30 2009

Keywords

Comments

Permutation of nonnegative integers.
The lodumo_m transformation of a list L is the list L' such that L'(n) is the smallest nonnegative integer not occurring earlier in L' and equal to L(n) (mod m). - M. F. Hasler, Dec 06 2010

Crossrefs

Cf. A000002.

Formula

a(n) = lod_2(A000002(n+1)).