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!)
A327167 a(n) = Product_{d|A276086(n), d>1} A008578(1+A286561(n,d)), where A286561(n,d) gives the highest exponent of d dividing n. 5
1, 1, 2, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 8, 1, 1, 1, 1, 2, 2, 1, 1, 1, 6, 1, 5, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 2, 1, 2, 1, 1, 12, 1, 1, 1, 3, 6, 2, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 2, 8, 1, 1, 1, 1, 48, 1, 2, 1, 1, 2, 7, 1, 1, 2, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 6, 3, 3, 1, 1, 1, 1, 128 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = Product_{d|A276086(n), d>1} A008578(1+A286561(n,d)).
Other identities. For all n >= 1:
1+A001222(a(n)) = A327168(n).
PROG
(PARI)
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; };
A327167(n) = { my(m=1, v); fordiv(A276086(n), d, if((d>1) && ((v = valuation(n, d))>0), m *= prime(v))); (m); };
CROSSREFS
Sequence in context: A070084 A352635 A325937 * A268372 A361754 A298848
KEYWORD
nonn
AUTHOR
Antti Karttunen, Sep 19 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 11:14 EDT 2024. Contains 371278 sequences. (Running on oeis4.)