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 A084556 #12 Jul 29 2017 12:51:18
%S A084556 0,1,2,2,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,
%T A084556 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
%U A084556 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5
%N A084556 n occurs n! times.
%C A084556 Also minimum i such that A007489(i) >= n.
%C A084556 For n>=1, a(n) gives the length of the n-th permutation in the sequences like A030298 & A030496.
%H A084556 A. Karttunen, <a href="/A084556/b084556.txt">Table of n, a(n) for n = 0..46234</a>
%H A084556 <a href="/index/Per#perm">Index entries for sequences related to permutations</a>
%t A084556 Flatten[ Table[#, {#!}] & /@ Range[0, 5]]
%Y A084556 First differences of A084555. Used to compute A084557. Differs from A084506 first time at the 130th term, where A084506(130) = 6, while A084556(130) = 5. Cf. also A002024, A072643, A072649, A090529.
%K A084556 nonn
%O A084556 0,3
%A A084556 _Antti Karttunen_, Jun 02 2003