login
A244317
n occurs A014138(n) times.
2
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, 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, 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
OFFSET
0,3
COMMENTS
For n >= 1, a(n) = 1 + the least k such that A014143(k) >= n.
Useful when computing A244314.
FORMULA
For all n >= 0, a(A014143(n)) = n+1 and a(1+A014143(n)) = n+2.
MATHEMATICA
Join[{0}, Flatten[Table[#[[2]], #[[1]]]&/@With[{nn=6}, Thread[{Join[Accumulate[ CatalanNumber[ Range[ nn]]]], Range[nn]}]]]] (* Harvey P. Dale, Sep 06 2023 *)
PROG
(Scheme) (define (A244317 n) (if (zero? n) n (let loop ((k 0)) (if (>= (A014143 k) n) (+ 1 k) (loop (+ 1 k))))))
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Antti Karttunen, Jul 18 2014
STATUS
approved