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.

A366584 a(2) = a(3) = 1; for n >3, a(n) = largest prime factor of n-th Tribonacci number.

Original entry on oeis.org

1, 1, 2, 2, 7, 13, 3, 11, 3, 149, 137, 7, 103, 31, 7, 103, 103, 79, 97, 5501, 3469, 919, 51343, 188869, 853, 1427, 470077, 239, 313, 307, 73, 883483, 11113, 227, 53, 3833, 631, 40093, 4349, 354763, 142739687, 45181, 40320889337, 71584631, 3331, 5500283
Offset: 2

Views

Author

Tyler Busby, Oct 13 2023

Keywords

Examples

			For n=24: A000073(24) = 2*2*2*51343, so a(24)=51343.
		

Crossrefs

Programs

  • Mathematica
    FactorInteger[#][[-1, 1]] & /@ LinearRecurrence[{1, 1, 1}, {1, 1, 2}, 46] (* Amiram Eldar, Oct 23 2023 *)

Formula

a(n) = A006530(A000073(n)).