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.
%I A160051 #17 Nov 27 2023 12:16:36 %S A160051 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, %T A160051 26,27,29,28,31,33,30,35,32,34,37,36,38,39,41,40,43,42,44,45,46,47,49, %U A160051 48,51,53,50,52,55,54,56,57,59,58,61,60,62,63,64,66,65,67,68,69,71,70,73 %N A160051 Lodumo_2 of Kolakoski sequence (A000002). %C A160051 Permutation of nonnegative integers. %C A160051 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 %H A160051 R. J. Mathar, <a href="http://oeis.org/transforms.txt">LODUMO transform, in: N. J. A. Sloane, "Transformations of Integer Sequences"</a>, Oct 16 2010. %H A160051 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %H A160051 OEIS wiki, <a href="/wiki/Lodumo_transform">Lodumo transform</a> %F A160051 a(n) = lod_2(A000002(n+1)). %Y A160051 Cf. A000002. %K A160051 easy,nonn %O A160051 0,3 %A A160051 _Philippe Deléham_, Apr 30 2009