A263270 - OEIS

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

(list; graph; refs; listen; history; text; internal format)

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)))