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

%I #9 Jan 09 2020 03:06:19

%S 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,

%T 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,

%U 4,4,3,4,4,3,3,2,3,4,3,4,5,4,4,3,4,5,4

%N The number of terms in the negaFibonacci representation of -n (A215023).

%C The Fibonacci numbers F(2*n - 1) are the indices of records of this sequence.

%H Amiram Eldar, <a href="/A331084/b331084.txt">Table of n, a(n) for n = 1..10000</a>

%F a(A000045(2*n)) = 1.

%F a(A000045(2*n - 1)) = n.

%e The negaFibonacci representation of 2 is A215023(2) = 1001, thus a(2) = 1 + 0 + 0 + 1 = 2.

%t 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]

%Y Cf. A000045, A215023, A331083.

%Y Cf. A000120, A007895, A007953, A053735, A095791.

%K nonn,base

%O 1,2

%A _Amiram Eldar_, Jan 08 2020

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 April 19 23:40 EDT 2024. Contains 371798 sequences. (Running on oeis4.)