login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #17 Sep 05 2024 19:13:44

%S 0,3,2,15,9,8,11,10,63,37,36,39,33,32,35,34,47,41,40,43,42,255,149,

%T 148,151,145,144,147,146,159,133,132,135,129,128,131,130,143,137,136,

%U 139,138,191,165,164,167,161,160,163,162,175,169,168,171,170,1023,597

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

%C The binary plot of the sequence has interesting features (see Illustration in Links section).

%H Rémy Sigrist, <a href="/A345291/b345291.txt">Table of n, a(n) for n = 0..6764</a>

%H Rémy Sigrist, <a href="/A345291/a345291.png">Binary plot of the first Fibonacci(13) = 233 terms</a>

%H Rémy Sigrist, <a href="/A345291/a345291.gp.txt">PARI program for A345291</a>

%e We have:

%e n | 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

%e ----------+------------------------------------------------------------------

%e A345290(n)| 0 -1 2 1 -3 -4 -1 -2 5 4 7 6 2 1 4 3 -8 -9

%e - so a(0) = 0,

%e a(2) = 2,

%e a(1) = 3,

%e a(5) = 8,

%e a(4) = 9,

%e a(7) = 10,

%e a(6) = 11,

%e a(3) = 15.

%o (PARI) \\ See Links section.

%Y Cf. A003754, A345290, A345292.

%K nonn,base

%O 0,2

%A _Rémy Sigrist_, Jun 13 2021