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 A220658 #10 Dec 19 2012 12:06:59 %S A220658 0,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,6,7,7,7,7,8,8,8,8,9,9,9,9,10,10, %T A220658 10,10,11,11,11,11,12,12,12,12,13,13,13,13,14,14,14,14,15,15,15,15,16, %U A220658 16,16,16,17,17,17,17,18,18,18,18,19,19,19,19,20,20 %N A220658 Irregular table, where the n-th row consists of A084558(n)+1 copies of n. %C A220658 Equally, for n>=1, each i in range [n!,(n+1)!-1] occurs n+1 times. %C A220658 Used for computing A220659, A055089 and A060118: The n-th term a(n) tells which permutation (counted from the start, zero-based) of A055089 or A060117/A060118 the n-th term in those sequence belongs to. %H A220658 A. Karttunen, <a href="/A220658/b220658.txt">Rows 0..720 of the irregular table, flattened.</a> %e A220658 Rows of this irregular table begin as: %e A220658 0; %e A220658 1, 1; %e A220658 2, 2, 2; %e A220658 3, 3, 3; %e A220658 4, 4, 4; %e A220658 5, 5, 5; %e A220658 6, 6, 6, 6; %e A220658 The terms A055089(3), A055089(4) and A055089(5) are 1,3,2. As a(3), a(4) and a(5) are all 2, we see that "132" is the second permutation in A055089-list, after the identity permutation "1", which has the index zero. %o A220658 (Scheme with _Antti Karttunen_'s intseq-library): (define A220658 (COMPOSE (LEAST-GTE-I 1 0 (COMPOSE A220657 1+)) 1+)) %Y A220658 Cf. A220657, A220659. %K A220658 nonn,tabf %O A220658 0,4 %A A220658 _Antti Karttunen_, Dec 18 2012