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

Offset: 1

Author

Antti Karttunen, Nov 15 2016

Keywords

• nonn

Comments

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

Links

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

Crossrefs

Cf. A000123, A131205, A277903, A278164.

Programs

Scheme

(define (A278163 n) (let loop ((k 0)) (if (>= (A131205 (+ 1 k)) n) k (loop (+ 1 k)))))
(definec (A131205 n) (if (= 1 n) 1 (+ (A000123 (- n 1)) (A131205 (- n 1)))))
;; For other code, see A277903.

Formula

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