This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324896 Largest proper divisor of A324886(n). 3
 1, 1, 1, 3, 1, 5, 1, 5, 7, 7, 1, 125, 1, 11, 16807, 75, 1, 245, 1, 343, 161051, 13, 1, 175, 102487, 17, 11, 1331, 1, 26411, 1, 7, 371293, 19, 3293331899, 300125, 1, 23, 1419857, 11, 1, 13, 1, 2197, 161051, 29, 1, 343, 82055753, 73525096183, 2476099, 4913, 1, 605, 634933, 19487171, 6436343, 31, 1, 65219, 1, 37, 265837, 147 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Antti Karttunen, Table of n, a(n) for n = 1..2310 FORMULA a(n) = A032742(A324886(n)) = A324895(A108951(n)). PROG (PARI) A034386(n) = prod(i=1, primepi(n), prime(i)); A032742(n) = if(1==n, n, n/vecmin(factor(n)[, 1])); A108951(n) = { my(f=factor(n)); prod(i=1, #f~, A034386(f[i, 1])^f[i, 2]) };  \\ From A108951 A276086(n) = { my(i=0, m=1, pr=1, nextpr); while((n>0), i=i+1; nextpr = prime(i)*pr; if((n%nextpr), m*=(prime(i)^((n%nextpr)/pr)); n-=(n%nextpr)); pr=nextpr); m; }; A324886(n) = A276086(A108951(n)); A324896(n) = A032742(A324886(n)); CROSSREFS Cf. A032742, A108951, A276086, A324886, A324895. Sequence in context: A214737 A046730 A002972 * A029652 A238952 A129510 Adjacent sequences:  A324893 A324894 A324895 * A324897 A324898 A324899 KEYWORD nonn AUTHOR Antti Karttunen, Mar 30 2019 STATUS approved

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

Last modified May 19 06:41 EDT 2019. Contains 323386 sequences. (Running on oeis4.)