0,3

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

a(n) = A219643(n)+A219644(n)-1.

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

(define A219645 (PARTIALSUMS 1 0 (compose-funs A219644 1+)))

(define A219645v2 (compose-funs -1+ (LEAST-I-WITH-FUN-I-EQ-N 0 0 A219642) 1+)) ;; Slow.

(define (A219645v3 n) (+ (A219643 n) (A219644 n) -1))

Cf. A219643 for the least inverse. A219644 gives the first differences.

This sequence is based on Fibonacci number system (Zeckendorf expansion): A014417. Analogous sequence for binary system: A173601, for factorial number system: A219655.

Sequence in context: A157202 A282896 A141437 * A186708 A227697 A097457

Adjacent sequences: A219642 A219643 A219644 * A219646 A219647 A219648

nonn

Antti Karttunen, Nov 24 2012

approved