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 A244317 #11 Sep 06 2023 12:55:03
%S A244317 0,1,2,2,2,3,3,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,
%T A244317 4,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 A244317 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,6
%N A244317 n occurs A014138(n) times.
%C A244317 For n >= 1, a(n) = 1 + the least k such that A014143(k) >= n.
%C A244317 Useful when computing A244314.
%F A244317 For all n >= 0, a(A014143(n)) = n+1 and a(1+A014143(n)) = n+2.
%t A244317 Join[{0},Flatten[Table[#[[2]],#[[1]]]&/@With[{nn=6},Thread[{Join[Accumulate[ CatalanNumber[ Range[ nn]]]],Range[nn]}]]]] (* _Harvey P. Dale_, Sep 06 2023 *)
%o A244317 (Scheme) (define (A244317 n) (if (zero? n) n (let loop ((k 0)) (if (>= (A014143 k) n) (+ 1 k) (loop (+ 1 k))))))
%Y A244317 Cf. A014138, A014143, A244314, A072643, A081288, A244160.
%K A244317 nonn,easy
%O A244317 0,3
%A A244317 _Antti Karttunen_, Jul 18 2014