The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A293515 a(n) = Product_{d^k|n, d>1, k>1} prime(A286561(n,d)-1), where A286561(n,d) gives the highest exponent of d dividing n. 5
 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 10, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 1, 1, 14, 1, 1, 1, 8, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 10, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 1, 2, 66, 1, 1, 1, 2, 1, 1, 1, 12, 1, 1, 2, 2, 1, 1, 1, 10, 10, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 14, 1, 2, 2, 8, 1, 1, 1, 3, 1, 1, 1, 12, 1, 1, 1, 10, 1, 1, 1, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(n) = Product_{d|n, d>1} A008578(A286561(n,d)). a(n) = A064989(A293514(n)). Other identities. For all n >= 1: 1 + A001222(a(n)) = A046951(n). PROG (PARI) A293515(n) = { my(m=1, v); fordiv(n, d, if(d>1, v = valuation(n, d); if(v>1, m *= prime(v-1)))); m; }; CROSSREFS Cf. A000040, A008578, A286561. Cf. A293514, A294875. Cf. A046951. Sequence in context: A321271 A305193 A038538 * A326622 A292777 A088529 Adjacent sequences:  A293512 A293513 A293514 * A293516 A293517 A293518 KEYWORD nonn AUTHOR Antti Karttunen, Nov 11 2017 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 April 10 14:07 EDT 2021. Contains 342845 sequences. (Running on oeis4.)