The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A331084 The number of terms in the negaFibonacci representation of -n (A215023). 3
1, 2, 1, 2, 3, 2, 2, 1, 2, 3, 2, 3, 4, 3, 3, 2, 3, 3, 2, 2, 1, 2, 3, 2, 3, 4, 3, 3, 2, 3, 4, 3, 4, 5, 4, 4, 3, 4, 4, 3, 3, 2, 3, 4, 3, 4, 4, 3, 3, 2, 3, 3, 2, 2, 1, 2, 3, 2, 3, 4, 3, 3, 2, 3, 4, 3, 4, 5, 4, 4, 3, 4, 4, 3, 3, 2, 3, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The Fibonacci numbers F(2*n - 1) are the indices of records of this sequence.
LINKS
FORMULA
a(A000045(2*n)) = 1.
a(A000045(2*n - 1)) = n.
EXAMPLE
The negaFibonacci representation of 2 is A215023(2) = 1001, thus a(2) = 1 + 0 + 0 + 1 = 2.
MATHEMATICA
ind[n_] := Floor[Log[Abs[n]*Sqrt[5] + 1/2]/Log[GoldenRatio]]; f[1] = 1; f[n_] := If[n > 0, i = ind[n - 1]; If[EvenQ[i], i++]; i, i = ind[-n]; If[OddQ[i], i++]; i]; nf[n_] := Module[{k = n, s = 0}, While[k != 0, i = f[k]; s += 1; k -= Fibonacci[-i]]; s]; a[n_] := nf[-n]; Array[a, 100]
CROSSREFS
Sequence in context: A123884 A178412 A182598 * A067694 A131810 A365143
KEYWORD
nonn,base
AUTHOR
Amiram Eldar, Jan 08 2020
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 11 13:44 EDT 2024. Contains 373311 sequences. (Running on oeis4.)