login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A104367 Greatest prime factor of A104365(n) = A104350(n) + 1. 8

%I #28 Apr 15 2023 14:08:46

%S 2,3,7,13,61,181,97,2521,7561,367,415801,1247401,97103,594311,2689891,

%T 269,415147,1434493,1099944846001,13421,938977307561,1687166397251,

%U 6121943187511,13027211250107,146100174169950001,1389833,10603380543703,2129284819,1156675078903494150001,132597517693,47172675889,11159737,20350106034371

%N Greatest prime factor of A104365(n) = A104350(n) + 1.

%H Max Alekseyev, <a href="/A104367/b104367.txt">Table of n, a(n) for n = 1..158</a> (terms 1..76 from Amiram Eldar, terms 142..151 from Tyler Busby)

%H Reinhard Zumkeller, <a href="/A104350/a104350.txt">Products of largest prime factors of numbers <= n</a>

%F a(n) = A006530(A104365(n)).

%t a[n_] := FactorInteger[1 + Product[FactorInteger[k][[-1, 1]], {k, 1, n}]][[-1, 1]]; Array[a, 76] (* _Amiram Eldar_, Feb 12 2020 *)

%Y Cf. A006530, A002583, A002585, A104350, A104359, A104365, A104366, A104368, A104369, A104370, A104371, A104372.

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Mar 06 2005

%E Corrected by _T. D. Noe_, Nov 15 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)