cp's OEIS Frontend

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

%I A345292 #12 Jun 17 2021 09:11:49
%S A345292 0,1,7,4,5,31,18,19,16,17,23,20,21,127,74,75,72,73,79,66,67,64,65,71,
%T A345292 68,69,95,82,83,80,81,87,84,85,511,298,299,296,297,303,290,291,288,
%U A345292 289,295,292,293,319,266,267,264,265,271,258,259,256,257,263,260,261
%N A345292 a(n) is the least k >= 0 such that A345290(k) = -n.
%C A345292 The binary plot of the sequence has interesting features (see Illustration in Links section).
%H A345292 Rémy Sigrist, <a href="/A345292/b345292.txt">Table of n, a(n) for n = 0..6764</a>
%H A345292 Rémy Sigrist, <a href="/A345292/a345292.png">Binary plot of the first Fibonacci(13) = 233 terms</a>
%H A345292 Rémy Sigrist, <a href="/A345292/a345292.gp.txt">PARI program for A345292</a>
%e A345292 We have:
%e A345292   n         | 0   1  2  3   4   5   6   7  8  9  10  11  12  13  14  15  16  17
%e A345292   ----------+------------------------------------------------------------------
%e A345292   A345290(n)| 0  -1  2  1  -3  -4  -1  -2  5  4   7   6   2   1   4   3  -8  -9
%e A345292 - so a(0) = 0,
%e A345292      a(1) = 1,
%e A345292      a(3) = 4,
%e A345292      a(4) = 5,
%e A345292      a(2) = 7,
%e A345292      a(8) = 16,
%e A345292      a(9) = 17.
%o A345292 (PARI) See Links section.
%Y A345292 Cf. A345290, A345291.
%K A345292 nonn,base
%O A345292 0,3
%A A345292 _Rémy Sigrist_, Jun 13 2021