A343646 - OEIS

A343646

a(0) = 0, and for any n > 0 such that F(k) <= n < F(k+1) for some k > 1, a(n) = F(k) + a(F(k+1) - n - 1) (where F(k) = A000045(k) is the k-th Fibonacci number).

0, 1, 2, 4, 3, 7, 6, 5, 11, 12, 10, 9, 8, 18, 19, 20, 16, 17, 15, 14, 13, 29, 30, 31, 33, 32, 26, 27, 28, 24, 25, 23, 22, 21, 47, 48, 49, 51, 50, 54, 53, 52, 42, 43, 44, 46, 45, 39, 40, 41, 37, 38, 36, 35, 34, 76, 77, 78, 80, 79, 83, 82, 81, 87, 88, 86, 85, 84

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

OFFSET

0,3

COMMENTS

This sequence is a permutation of the nonnegative integers with inverse A343647.

This sequence has similarities with A003188; here we use Fibonacci numbers, there powers of 2.

LINKS

Rémy Sigrist, Table of n, a(n) for n = 0..10945

Index entries for sequences that are permutations of the natural numbers

FORMULA

a(n) < A000045(k) for any n < A000045(k).

EXAMPLE