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!)
A331090 Positive numbers k such that -k, -(k + 1), and -(k + 2) are 3 consecutive negative negaFibonacci-Niven numbers (A331088). 3
1, 2, 20, 54, 55, 56, 110, 376, 398, 974, 986, 1084, 1744, 2464, 2524, 3304, 3870, 5223, 5718, 6095, 6124, 6184, 6663, 6764, 6844, 7142, 7684, 9035, 9124, 10590, 11598, 11975, 12606, 13444, 13504, 14284, 14915, 17164, 17643, 17710, 17714, 17824, 17884, 18698, 18905, 19494, 23191, 24243, 24785, 25542, 26382, 27390, 29644, 34278, 35464 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Numbers of the form F(6*k + 2) - 1 and F(6*k + 4) - 1, where F(m) is the m-th Fibonacci number, are terms.
If m is of the form F(k) - 1, where k > 2 is congruent to {2, 10} mod 24, then {-m, -(m + 1), -(m + 2), -(m + 3), -(m + 4)} are 5 consecutive negative negaFibonacci-Niven numbers.
LINKS
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];
negaFibTermsNum[n_] := Module[{k = n, s = 0}, While[k != 0, i = f[k]; s += 1; k -= Fibonacci[-i]]; s];
negFibQ[n_] := Divisible[n, negaFibTermsNum[-n]];
nConsec = 3; neg = negFibQ /@ Range[nConsec]; seq = {}; c = 0;
k = nConsec+1; While[c < 55, If[And @@ neg, c++; AppendTo[seq, k - nConsec]]; neg = Join[Rest[neg], {negFibQ[k]}]; k++]; seq
CROSSREFS
Sequence in context: A349503 A225065 A059211 * A139271 A133217 A001504
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 April 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)