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.

A104576 Indices of primes in A001644 (the Lucas 3-step numbers).

Original entry on oeis.org

2, 3, 4, 7, 8, 9, 10, 12, 20, 30, 33, 66, 76, 77, 82, 87, 98, 180, 205, 360, 553, 719, 766, 1390, 1879, 1999, 4033, 5620, 16506, 17436, 23676, 24428, 27758, 31932, 58199, 67661, 85040, 102023, 185595
Offset: 1

Views

Author

T. D. Noe, Mar 16 2005

Keywords

Comments

The sequence of generalized tribonacci numbers is defined as beginning with 1, 3, 7. Subsequent terms are the sum of the previous three terms. Note that the sequence of these generalized tribonacci numbers has many more primes than the tribonacci sequence A000073 (whose prime indices are in A092835).
a(40) > 2*10^5. - Robert Price, Dec 24 2013

Crossrefs

Cf. A104577 (indices of prime generalized tetranacci numbers).

Formula

A001644(a(n)) = A105762(n). - Arthur O'Dwyer, Jul 26 2024

Extensions

a(37)-a(39) from Robert Price, Dec 24 2013
Name clarified by Arthur O'Dwyer, Jul 25 2024

A105285 Indices of Lucas 3-step numbers A001644 which have a nontrivial divisor in common with index.

Original entry on oeis.org

6, 15, 18, 21, 35, 39, 44, 45, 54, 55, 57, 78, 80, 84, 90, 93, 96, 117, 120, 123, 132, 133, 135, 140, 147, 154, 156, 162, 171, 174, 195, 201, 210, 213, 234, 235, 240, 245, 247, 249, 252, 259, 264, 273, 275, 279, 286, 288, 290, 291, 295, 299, 312, 318, 323, 327
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 A105762 (prime Lucas 3-step numbers).

Examples

			gcd(6, A001644(6)) = gcd(6,39) = 3,
gcd(21, A001644(21)) = gcd(21,361109) = 7.
		

Crossrefs

Programs

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

Formula

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

Extensions

More terms from Amiram Eldar, Sep 05 2019
Showing 1-2 of 2 results.