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!)
A104366 Smallest prime factor of A104365(n) = A104350(n) + 1. 8

%I #33 Feb 21 2023 07:34:10

%S 2,3,7,13,61,181,13,2521,7561,103,415801,1247401,167,191,211,127,23,

%T 40357,1099944846001,349,41,251,37,2243,146100174169950001,103,53,

%U 1217,1156675078903494150001,47,2939,251,857,41,547,13127,47,48563,281,1336484560722851,479,373,2179,577670972464621571,17491,1399,97,22893547

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

%C a(n) = A020639(A104365(n)).

%H Tyler Busby, <a href="/A104366/b104366.txt">Table of n, a(n) for n = 1..170</a> (terms 1..100 from Chai Wah Wu, terms 101..165 from Max Alekseyev)

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

%o (PARI) gpf(n) = if (n==1, 1, vecmax(factor(n)[,1])); \\ A006530

%o spf(n) = if (n==1, 1, vecmin(factor(n)[,1])); \\ A020639

%o a(n) = spf(prod(i=2, n, gpf(i))+1); \\ _Michel Marcus_, Feb 21 2023

%Y Cf. A104367, A104358, A051301, A051342, A104358, A104365, A104367, A104368, A104369, A104370, A104371, A104372.

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Mar 06 2005

%E Corrected by _D. S. McNeil_, Dec 10 2010

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 24 10:11 EDT 2024. Contains 371935 sequences. (Running on oeis4.)