cp's OEIS Frontend

A345291 a(n) is the least k >= 0 such that A345290(k) = n.

%I A345291 #17 Sep 05 2024 19:13:44
%S A345291 0,3,2,15,9,8,11,10,63,37,36,39,33,32,35,34,47,41,40,43,42,255,149,
%T A345291 148,151,145,144,147,146,159,133,132,135,129,128,131,130,143,137,136,
%U A345291 139,138,191,165,164,167,161,160,163,162,175,169,168,171,170,1023,597
%N A345291 a(n) is the least k >= 0 such that A345290(k) = n.
%C A345291 The binary plot of the sequence has interesting features (see Illustration in Links section).
%H A345291 Rémy Sigrist, <a href="/A345291/b345291.txt">Table of n, a(n) for n = 0..6764</a>
%H A345291 Rémy Sigrist, <a href="/A345291/a345291.png">Binary plot of the first Fibonacci(13) = 233 terms</a>
%H A345291 Rémy Sigrist, <a href="/A345291/a345291.gp.txt">PARI program for A345291</a>
%e A345291 We have:
%e A345291   n         | 0   1  2  3   4   5   6   7  8  9  10  11  12  13  14  15  16  17
%e A345291   ----------+------------------------------------------------------------------
%e A345291   A345290(n)| 0  -1  2  1  -3  -4  -1  -2  5  4   7   6   2   1   4   3  -8  -9
%e A345291 - so a(0) = 0,
%e A345291      a(2) = 2,
%e A345291      a(1) = 3,
%e A345291      a(5) = 8,
%e A345291      a(4) = 9,
%e A345291      a(7) = 10,
%e A345291      a(6) = 11,
%e A345291      a(3) = 15.
%o A345291 (PARI) \\ See Links section.
%Y A345291 Cf. A003754, A345290, A345292.
%K A345291 nonn,base
%O A345291 0,2
%A A345291 _Rémy Sigrist_, Jun 13 2021