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 A220663 #13 Mar 31 2025 22:31:21 %S A220663 0,0,1,0,1,0,1,2,0,1,2,0,1,2,0,1,2,0,1,2,0,1,2,0,1,2,3,0,1,2,3,0,1,2, %T A220663 3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,0, %U A220663 1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3 %N A220663 Irregular table: row n (n>=1) consists of numbers 0..A084556(n)-1. %C A220663 The term a(n) tells from which position (zero-based, starting from the left hand end of permutation) of the corresponding permutation in A030298 the term A030298(n) should be picked from. %H A220663 A. Karttunen, <a href="/A220663/b220663.txt">Rows 1..998 of the irregular table, flattened.</a> %F A220663 a(n) = n - A220662(n). %F A220663 a(n) = A220694(n)-1. %e A220663 Rows of this irregular table begin as: %e A220663 0; %e A220663 0, 1; %e A220663 0, 1; %e A220663 0, 1, 2; %e A220663 0, 1, 2; %e A220663 ... %o A220663 (Scheme) (define (A220663 n) (- n (A220662 n))) %Y A220663 Cf. A220662, A220694, A030298. %K A220663 nonn,tabf %O A220663 1,8 %A A220663 _Antti Karttunen_, Dec 18 2012