login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A345292 a(n) is the least k >= 0 such that A345290(k) = -n. 3

%I

%S 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 68,69,95,82,83,80,81,87,84,85,511,298,299,296,297,303,290,291,288,

%U 289,295,292,293,319,266,267,264,265,271,258,259,256,257,263,260,261

%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="/A345292/b345292.txt">Table of n, a(n) for n = 0..6764</a>

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

%H Rémy Sigrist, <a href="/A345292/a345292.gp.txt">PARI program for A345292</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(1) = 1,

%e a(3) = 4,

%e a(4) = 5,

%e a(2) = 7,

%e a(8) = 16,

%e a(9) = 17.

%o (PARI) See Links section.

%Y Cf. A345290, A345291.

%K nonn,base

%O 0,3

%A _Rémy Sigrist_, Jun 13 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 24 20:35 EDT 2021. Contains 348233 sequences. (Running on oeis4.)