login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A278163 a(n) = the least k such that A131205(1+k) >= n; each n occurs A000123(n) times. 3
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
FORMULA
a(A131205(1+n)) = n.
PROG
(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.
CROSSREFS
Sequence in context: A064557 A365737 A023967 * A347635 A260999 A090532
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 15 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 25 09:55 EDT 2024. Contains 374587 sequences. (Running on oeis4.)