

A244230


a(n) = the least k such that A197433(k) >= n.


7



0, 1, 2, 3, 4, 4, 5, 6, 7, 8, 8, 8, 8, 8, 8, 9, 10, 11, 12, 12, 13, 14, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 18, 19, 20, 20, 21, 22, 23, 24, 24, 24, 24, 24, 24, 25, 26, 27, 28, 28, 29, 30, 31, 32, 32, 32, 32
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

For n >= 1, a(n) = total number of ways the natural numbers in range 1 .. n can be represented as sums of distinct Catalan numbers (A000108). Note that for any one number, number of such solutions may be at most one. In other words, this sequence is one less than the partial sums of A176137 (number of partitions of n into distinct Catalan numbers).


LINKS

Antti Karttunen, Table of n, a(n) for n = 0..6918


FORMULA

For all n >= 0, a(A197433(n)) = n. [This works as an inverse function for the injection A197433].


PROG

(Scheme, with Antti Karttunen's IntSeqlibrary)
(define A244230 (LEASTGTEI 0 0 A197433))


CROSSREFS

The first differences give A176137 from its term a(1) onward.
Cf. A000108, A197433.
Sequence in context: A195172 A277425 A245335 * A277814 A006162 A036701
Adjacent sequences: A244227 A244228 A244229 * A244231 A244232 A244233


KEYWORD

nonn


AUTHOR

Antti Karttunen, Jun 25 2014


STATUS

approved



