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!)
A331088 Positive numbers k such that -k is a negative negaFibonacci-Niven number, i.e., divisible by the number of terms in its negaFibonacci representation (A331084). 7

%I #11 Jan 09 2020 03:06:38

%S 1,2,3,4,6,8,12,15,16,18,20,21,22,24,27,30,36,42,44,45,48,50,51,54,55,

%T 56,57,58,60,66,72,75,76,80,84,90,92,96,100,104,105,108,110,111,112,

%U 115,116,120,124,126,128,129,132,136,138,141,142,144,150,152,153,156,168,170,172,175,176,180,184,186,190,192,196,198

%N Positive numbers k such that -k is a negative negaFibonacci-Niven number, i.e., divisible by the number of terms in its negaFibonacci representation (A331084).

%C The k-th Fibonacci number is a term for all even k, since its negaFibonacci representation is 1 followed by (k-1) zeros.

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

%e 4 is a term since the negaFibonacci representation of -4 is 1010 whose sum of digits is 1 + 0 + 1 + 0 = 2 which is a divisor of 4.

%t ind[n_] := Floor[Log[Abs[n]*Sqrt[5] + 1/2]/Log[GoldenRatio]];

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

%t negaFibTermsNum[n_] := Module[{k = n, s = 0}, While[k != 0, i = f[k]; s += 1; k -= Fibonacci[-i]]; s];

%t Select[Range[200], Divisible[#, negaFibTermsNum[-#]] &]

%Y Cf. A005349, A215023, A328208, A328212, A331083, A331084, A331085.

%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 September 12 12:46 EDT 2024. Contains 375851 sequences. (Running on oeis4.)