The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A160051 Lodumo_2 of Kolakoski sequence (A000002). 0
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 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 LINKS R. J. Mathar, LODUMO transform, in: N. J. A. Sloane, "Transformations of Integer Sequences", Oct 16 2010. FORMULA a(n) = lod_2(A000002(n+1)). CROSSREFS Cf. A000002. Sequence in context: A234923 A145391 A057756 * A082746 A098313 A098311 Adjacent sequences:  A160048 A160049 A160050 * A160052 A160053 A160054 KEYWORD easy,nonn AUTHOR Philippe Deléham, Apr 30 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 31 19:40 EDT 2020. Contains 334748 sequences. (Running on oeis4.)