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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A327156 a(n) = Product_{d|n, d>1} A008578(1+A286561(n,sigma(d))), where A286561(n,x) gives the highest exponent of x dividing n. 4
 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 8, 1, 1, 1, 2, 1, 4, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 5, 1, 8, 1, 1, 1, 16, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 32, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 2, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537 FORMULA a(n) = Product_{d|n, d>1} A008578(1+A286561(n,sigma(d))), where sigma = A000203. Other identities. For all n >= 1: 1+A001222(a(n)) = A173441(n). PROG (PARI) A327156(n) = { my(m=1, v); fordiv(n, d, if((d>1) && ((v = valuation(n, sigma(d)))>0), m *= prime(v))); (m); }; CROSSREFS Cf. A000040, A008578, A286561, A173441. Cf. also A293514, A322312, A323155, A327154, A327155. Sequence in context: A115878 A127125 A256671 * A114171 A154243 A326698 Adjacent sequences:  A327153 A327154 A327155 * A327157 A327158 A327159 KEYWORD nonn AUTHOR Antti Karttunen, Sep 18 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 4 17:52 EDT 2022. Contains 355083 sequences. (Running on oeis4.)