cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A331086 Positive numbers k such that k and k + 1 are both negaFibonacci-Niven numbers (A331085).

Original entry on oeis.org

1, 4, 5, 9, 12, 13, 26, 68, 86, 87, 88, 89, 93, 99, 155, 176, 177, 183, 195, 212, 230, 231, 232, 233, 237, 243, 255, 320, 321, 327, 384, 395, 411, 415, 424, 464, 465, 471, 475, 484, 515, 544, 575, 591, 602, 644, 655, 656, 744, 824, 875, 894, 924, 1043, 1115, 1127
Offset: 1

Views

Author

Amiram Eldar, Jan 08 2020

Keywords

Comments

Fibonacci numbers F(6*k - 1) and F(6*k) are terms.

Crossrefs

Programs

  • 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 = 2; 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