This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A277903 a(n) = the least k such that A000123(k) >= n. 4
 0, 1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Greatest monotonic left inverse of A000123. Each n occurs A018819(n) times. LINKS Antti Karttunen, Table of n, a(n) for n = 1..9828 FORMULA a(n) = A048675(A277905(n)). a(A000123(n)) = n. PROG (Scheme) (definec (A277903 n) (let loop ((k 0)) (if (>= (A000123 k) n) k (loop (+ 1 k))))) (define (A000123 n) (A018819 (+ n n))) (definec (A018819 n) (cond ((zero? n) 1) ((even? n) (+ (A018819 (- n 1)) (A018819 (/ n 2)))) (else (A018819 (- n 1))))) CROSSREFS Cf. A000123, A018819, A048675, A277904, A277905, A278163. Sequence in context: A137397 A239684 A062571 * A102515 A276571 A066063 Adjacent sequences:  A277900 A277901 A277902 * A277904 A277905 A277906 KEYWORD nonn AUTHOR Antti Karttunen, Nov 14 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 17 17:32 EDT 2019. Contains 327136 sequences. (Running on oeis4.)