A219643 - OEIS

A219643

Least inverse of A219642; a(n) = minimal i such that A219642(i) = n.

0, 1, 2, 3, 5, 7, 8, 10, 13, 15, 18, 21, 23, 26, 29, 32, 34, 36, 39, 42, 45, 47, 50, 54, 55, 57, 60, 63, 66, 68, 71, 75, 78, 81, 84, 89, 91, 94, 97, 100, 102, 105, 109, 112, 115, 118, 123, 126, 130, 134, 138, 143, 144, 146, 149, 152, 155, 157, 160, 164, 167

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

OFFSET

0,3

LINKS

A. Karttunen, Table of n, a(n) for n = 0..10000

PROG

(Scheme with Antti Karttunen's Intseq-library, three different variants):

(define A219643 (MATCHING-POS 0 0 (lambda (i) (or (< i 1) (not (= (A219642 (- i 1)) (A219642 i)))))))

(define A219643v2 (LEAST-I-WITH-FUN-I-EQ-N 0 0 A219642)) ;; Slow!

(define A219643v3 (RECORD-POS 0 0 A219642))

CROSSREFS

Cf. A219645 for the greatest inverse. A219644 gives the first differences.

This sequence is based on Fibonacci number system (Zeckendorf expansion): A014417. For analogous sequence in binary system, see: A213708, for factorial number system: A219653.

Sequence in context: A060107 A333230 A159556 * A194798 A302245 A028728

Adjacent sequences: A219640 A219641 A219642 * A219644 A219645 A219646

KEYWORD

nonn

AUTHOR

Antti Karttunen, Nov 24 2012

STATUS

approved