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!)
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

%I #9 Sep 18 2019 16:14:21

%S 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,

%T 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,

%U 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

%N 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.

%H Antti Karttunen, <a href="/A327156/b327156.txt">Table of n, a(n) for n = 1..16384</a>

%H Antti Karttunen, <a href="/A327156/a327156.txt">Data supplement: n, a(n) computed for n = 1..65537</a>

%F a(n) = Product_{d|n, d>1} A008578(1+A286561(n,sigma(d))), where sigma = A000203.

%F Other identities. For all n >= 1:

%F 1+A001222(a(n)) = A173441(n).

%o (PARI) A327156(n) = { my(m=1,v); fordiv(n,d,if((d>1) && ((v = valuation(n,sigma(d)))>0), m *= prime(v))); (m); };

%Y Cf. A000040, A008578, A286561, A173441.

%Y Cf. also A293514, A322312, A323155, A327154, A327155.

%K nonn

%O 1,6

%A _Antti Karttunen_, Sep 18 2019

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 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)