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.

A178767 Values of gcd(Fibonacci(n), Fibonacci(n+3)+2) sorted with no repeats.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 13, 36, 47, 68, 89, 123, 233, 644, 843, 1220, 1597, 2207, 4181, 11556, 15127, 21892, 28657, 39603, 75025, 207364, 271443, 392836, 514229, 710647, 1346269, 3720996, 4870847, 7049156, 9227465, 12752043, 24157817, 66770564, 87403803, 126491972
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Maple
    a:= proc(n) local l, r;
          l:= [1, 2, 3, 4, 5, 7, 13, 36, 47, 68, 89, 123, 233, 644];
          `if`(n<15, l[n], (<<0|1>, <-1|18>> ^iquo(n-3, 6, 'r').
                            <>) [1,1])
        end:
    seq(a(n), n=1..40);  # Alois P. Heinz, Dec 29 2010
  • Mathematica
    Take[Union@Table[GCD[Fibonacci[n],Fibonacci[n+3]+2],{n,1000}],60]

Formula

G.f.: (2*x^14 + 3*x^12 + x^11 + 4*x^10 + 7*x^9 + 5*x^7 - 7*x^6 - 5*x^5 - 4*x^4 - 3*x^3 - 2*x^2 - x) / (-x^12 + 18*x^6 - 1). - Alois P. Heinz, Dec 29 2010