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.

Showing 1-1 of 1 results.

A258575 Numbers n such that Lucas(n)-Fibonacci(n) is squarefree.

Original entry on oeis.org

0, 2, 3, 5, 6, 8, 9, 11, 12, 14, 15, 17, 18, 20, 21, 23, 24, 27, 29, 30, 32, 33, 35, 36, 38, 39, 41, 42, 44, 45, 47, 48, 50, 53, 54, 56, 59, 60, 62, 63, 65, 66, 68, 69, 71, 72, 74, 75, 77, 78, 80, 81, 83, 84, 86, 87, 89, 90, 93, 95, 96, 98, 99, 102, 104, 105
Offset: 1

Views

Author

Vincenzo Librandi, Jun 04 2015

Keywords

Comments

These numbers belong to the sequence A007494 (see Chai Wah Wu argumentation in A258574).
Also numbers n such that 2*Fibonacci(n-1) is squarefree. [Bruno Berselli, Jun 05 2015]
A258575(n) = A258574(n+1)-1. - Chai Wah Wu, Jun 09 2015

Crossrefs

Programs

  • Magma
    [0] cat [n: n in [2..150] | IsSquarefree(Lucas(n)-Fibonacci(n))];
    
  • Mathematica
    Select[Range[0, 200], SquareFreeQ[LucasL[#] - Fibonacci[#]] &]
  • Sage
    [n for n in (0..110) if is_squarefree(2*fibonacci(n-1))] # Bruno Berselli, Jun 05 2015

Extensions

Name corrected by Bruno Berselli, Jun 05 2015
Showing 1-1 of 1 results.