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.

A105289 Indices of Lucas 5-step numbers A074048 which have a nontrivial divisor in common with index.

Original entry on oeis.org

6, 12, 18, 20, 21, 33, 36, 48, 51, 54, 55, 60, 75, 78, 87, 99, 100, 108, 110, 112, 114, 120, 129, 132, 133, 144, 147, 153, 154, 155, 159, 162, 165, 174, 177, 180, 182, 183, 185, 195, 210, 219, 225, 228, 230, 234, 237, 245, 261, 267, 270, 275, 285, 290, 297, 310
Offset: 1

Views

Author

Jonathan Vos Post, Apr 25 2005

Keywords

Comments

Extension by T. D. Noe. Wanted: closed-form formula for this as exists for Fibonacci and Lucas numbers. See also A105764 (indices of prime Lucas 5-step numbers).

Examples

			gcd(6, A074048(6)) = gcd(6,57) = 3,
gcd(20, A074048(20)) = gcd(20,743775) = 5.
gcd(21, A074048(21)) = gcd(21,1462223) = 7.
		

Crossrefs

Programs

  • Mathematica
    m=300; s = LinearRecurrence[{1, 1, 1, 1, 1}, {5, 1, 3, 7, 15}, m+1]; Select[Range[m], !CoprimeQ[#, s[[#+1]]] &] (* Amiram Eldar, Sep 05 2019 *)

Formula

gcd(a(n), A074048(a(n))) > 1.

Extensions

More terms from Amiram Eldar, Sep 05 2019

A105765 Prime Lucas 5-step numbers, A074048.

Original entry on oeis.org

3, 7, 31, 113, 223, 439, 863, 6553, 641449337, 18837477823, 40276345611255837298559, 58893004546665606516457357571, 9774215601155945008361439560567878777
Offset: 1

Views

Author

T. D. Noe, Apr 22 2005

Keywords

Crossrefs

Cf. A105764 (indices of prime Lucas 5-step numbers).

Programs

  • Mathematica
    a={-1, -1, -1, -1, 5}; lst={}; Do[s=Plus@@a; a=RotateLeft[a]; a[[ -1]]=s; If[PrimeQ[s], AppendTo[lst, s]], {n, 1000}]; lst
Showing 1-2 of 2 results.