A263270 Each n occurs A262507(n) times.

0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 18

Offset

0,4

Links

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

Formula

Other identities. For all n >= 0:

a(n) = A155043(A263265(n)).

a(A263260(n)) = n+1. [The sequence is one more than the least monotonic left inverse of A263260.]

Prog

(Scheme, with Antti Karttunen's IntSeq-library)
(define A263270 (COMPOSE 1+ (LEFTINV-LEASTMONO 0 0 A263260)))

Crossrefs

Cf. A155043, A262507, A263260, A263265, A263266.

Sequence in context: A325678 A247189 A192002 * A337636 A011752 A175018

Adjacent sequences: A263267 A263268 A263269 * A263271 A263272 A263273

Keyword

nonn

Author

Antti Karttunen, Nov 24 2015

Status

approved