This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A255053 Least inverse of A255072; a(n) = smallest k such that A255072(k) = n. 6
 0, 1, 3, 6, 7, 11, 14, 15, 19, 23, 27, 30, 31, 35, 39, 44, 47, 51, 55, 59, 62, 63, 67, 71, 76, 79, 86, 91, 95, 99, 103, 108, 111, 115, 119, 123, 126, 127, 131, 135, 140, 143, 150, 155, 159, 166, 172, 176, 182, 187, 191, 195, 199, 204, 207, 214, 219, 223, 227, 231, 236, 239, 243, 247, 251, 254, 255 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Also positions of records in A255072. LINKS Antti Karttunen, Table of n, a(n) for n = 0..16143 FORMULA Other identities. For all n >= 0: a(0) = 0; for n > 0: a(n) = a(n-1) + A255054(n-1). a(n) = A255056(n) - A255123(n). PROG (Scheme, with Antti Karttunen's IntSeq-library, four different implementations): (define A255053 (MATCHING-POS 0 0 (lambda (i) (or (< i 1) (not (= (A255072 (- i 1)) (A255072 i))))))) (define A255053 (LEAST-I-WITH-FUN-I-EQ-N 0 0 A255072)) ;; Slow! (define A255053 (RECORD-POS 0 0 A255072)) (definec (A255053 n) (if (zero? n) n (+ (A255053 (- n 1)) (A255054 (- n 1))))) CROSSREFS Cf. A255072, A255054, A255055, A255056, A255123. Analogous sequences:  A213708, A219643, A219653. Sequence in context: A084349 A126003 A047556 * A292762 A258233 A015819 Adjacent sequences:  A255050 A255051 A255052 * A255054 A255055 A255056 KEYWORD nonn AUTHOR Antti Karttunen, Feb 14 2015 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 May 26 19:44 EDT 2019. Contains 323597 sequences. (Running on oeis4.)