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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324188 a(n) = A324121(A163511(n)). 5
 1, 1, 1, 2, 1, 1, 12, 2, 1, 4, 3, 1, 4, 12, 2, 2, 3, 1, 24, 4, 1, 2, 3, 3, 12, 6, 24, 4, 6, 4, 8, 2, 1, 2, 3, 1, 8, 24, 4, 4, 3, 1, 12, 6, 1, 6, 3, 1, 4, 120, 18, 2, 24, 24, 16, 4, 10, 2, 48, 4, 56, 12, 4, 2, 1, 1, 12, 6, 1, 2, 1, 1, 24, 12, 48, 40, 12, 8, 16, 4, 1, 20, 3, 3, 4, 36, 6, 14, 15, 3, 36, 6, 21, 2, 3, 3, 36, 6, 720, 8, 6, 4, 24, 6, 120, 12 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Antti Karttunen, Table of n, a(n) for n = 0..16384 Antti Karttunen, Data supplement: n, a(n) computed for n = 0..65537 FORMULA a(n) = A324121(A163511(n)) = gcd(A324184(n), A163511(n)*A324183(n)). For n > 0, a(n) = A324058(A054429(n)). PROG (PARI) A163511(n) = if(!n, 1, my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p)); A324121(n) = gcd(sigma(n), n*numdiv(n)); A324188(n) = A324121(A163511(n)); (PARI) A324183(n) = if(!n, 1, n = ((3<<#binary(n\2))-n-1); my(e=0, m=1); while(n>0, if(!(n%2), m *= (1+e); e=0, e++); n >>= 1); (m*(1+e))); A324184(n) = if(!n, 1, my(p=2, mp=p*p, m=1); while(n>1, if(n%2, p=nextprime(1+p); mp = p*p, if((2==n)||!(n%4), mp *= p, m *= (mp-1)/(p-1))); n >>= 1); (m*(mp-1)/(p-1))); A324188(n) = gcd(A324184(n), A163511(n)*A324183(n)); CROSSREFS Cf. A054429, A324058, A163511, A324121, A324183, A324184, A324187, A324189. Sequence in context: A197648 A066094 A160625 * A297762 A010246 A186430 Adjacent sequences: A324185 A324186 A324187 * A324189 A324190 A324191 KEYWORD nonn AUTHOR Antti Karttunen, Feb 17 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 March 4 05:23 EST 2024. Contains 370522 sequences. (Running on oeis4.)