|
|
A244225
|
|
a(n) = Number of nonnegative integers 0 <= k <= n, which have an odd representation in Greedy Catalan Base (A014418).
|
|
6
|
|
|
0, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 8, 9, 9, 10, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 14, 15, 15, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 20, 21, 21, 22, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 26, 27, 27, 28, 28, 28, 29, 29, 30, 30, 31, 31, 32, 32, 32
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
This works also as an inverse function for injection A244223: we have a(A244223(n)) = n for all n >= 1.
Equally, for n >= 1, a(n) = the largest k such that A244223(k) <= n.
After 0, each n occurs A244228(n) times.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The first nonnegative integers represented in Greedy Catalan Base look like:
Of these, the first "odd" representation (ending with one) occurs at n=1, thus a(0) = 0, but a(1) = 1. As the next odd occurs at n=3, also a(2) = 1, but a(3) = 1+1 = 2. The next odd representation does not occur until at n=6, thus a(4) = a(5) = 2 and a(6) = 3.
|
|
PROG
|
(Scheme, with Antti Karttunen's IntSeq-library for memoizing definec-macro)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|