A278163 - OEIS

A278163

a(n) = the least k such that A131205(1+k) >= n; each n occurs A000123(n) times.

0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8

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

OFFSET

1,4

COMMENTS

Greatest monotonic left inverse of A131205(1+n).

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..9669

FORMULA

a(A131205(1+n)) = n.

PROG

(Scheme)

(define (A278163 n) (let loop ((k 0)) (if (>= (A131205 (+ 1 k)) n) k (loop (+ 1 k)))))