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.

This page as a plain text file.
%I A366584 #11 Oct 23 2023 05:24:11
%S A366584 1,1,2,2,7,13,3,11,3,149,137,7,103,31,7,103,103,79,97,5501,3469,919,
%T A366584 51343,188869,853,1427,470077,239,313,307,73,883483,11113,227,53,3833,
%U A366584 631,40093,4349,354763,142739687,45181,40320889337,71584631,3331,5500283
%N A366584 a(2) = a(3) = 1; for n >3, a(n) = largest prime factor of n-th Tribonacci number.
%H A366584 Amiram Eldar, <a href="/A366584/b366584.txt">Table of n, a(n) for n = 2..365</a>
%F A366584 a(n) = A006530(A000073(n)).
%e A366584 For n=24: A000073(24) = 2*2*2*51343, so a(24)=51343.
%t A366584 FactorInteger[#][[-1, 1]] & /@ LinearRecurrence[{1, 1, 1}, {1, 1, 2}, 46] (* _Amiram Eldar_, Oct 23 2023 *)
%Y A366584 Cf. A000073, A231575, A101757.
%K A366584 nonn
%O A366584 2,3
%A A366584 _Tyler Busby_, Oct 13 2023