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-2 of 2 results.

A168041 Fibonacci numbers that are divisible by their index.

Original entry on oeis.org

1, 5, 144, 46368, 75025, 14930352, 4807526976, 1548008755920, 498454011879264, 51680708854858323072, 16641027750620563662096, 5358359254990966640871840, 59425114757512643212875125, 555565404224292694404015791808
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    f[n_]:=Fibonacci[n]/n; lst={};Do[If[IntegerQ[f[n]],AppendTo[lst,Fibonacci[n]]],{n,4*5!}];lst

Formula

a(n) = A000045(A023172(n)).

A272318 Integer values of Lucas number A000032(n)/n.

Original entry on oeis.org

1, 3, 321, 3572225067, 44308057022098435739157981016569
Offset: 1

Views

Author

Peter M. Chema, Apr 25 2016

Keywords

Comments

The digital root of this sequence appears to be alternately 3 and 6, aside from the initial term of "1".
A subsequence of A181885. For instance, a(2)=A181885(6), a(3)=A181885(18), a(4)=A181885(54); a(5)=A181885(162); and, a(6)=A181885(486). Also 6, 18, 54, 162 and 486 are consecutive terms of the Pinot sequence A008776. Is this a coincidence?

Crossrefs

Programs

  • Mathematica
    LucasL[#]/# & /@ Range@ 1200 /. _Rational -> Nothing (* Version 10.2, or *)
    Select[Array[LucasL[#]/# &, {1200}], IntegerQ] (* Michael De Vlieger, Apr 25 2016 *)

Formula

a(n) = A000032(A016089(n))/n. - Michel Marcus, Apr 25 2016
Showing 1-2 of 2 results.