This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324183 a(n) = d(A163511(n)), where d(n) is A000005, the number of divisors of n. 6
 1, 2, 3, 2, 4, 3, 4, 2, 5, 4, 6, 3, 6, 4, 4, 2, 6, 5, 8, 4, 9, 6, 6, 3, 8, 6, 8, 4, 6, 4, 4, 2, 7, 6, 10, 5, 12, 8, 8, 4, 12, 9, 12, 6, 9, 6, 6, 3, 10, 8, 12, 6, 12, 8, 8, 4, 8, 6, 8, 4, 6, 4, 4, 2, 8, 7, 12, 6, 15, 10, 10, 5, 16, 12, 16, 8, 12, 8, 8, 4, 15, 12, 18, 9, 18, 12, 12, 6, 12, 9, 12, 6, 9, 6, 6, 3, 12, 10, 16, 8, 18, 12, 12, 6, 16, 12 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS For all i, j: A286531(i) = A286531(j) => a(i) = a(j). LINKS Antti Karttunen, Table of n, a(n) for n = 0..65537 FORMULA a(n) = A000005(A163511(n)). a(n) = A106737(A054429(n)). For all n >= 0, a(2^n) = n+2. PROG (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))); (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)); A324183(n) = numdiv(A163511(n)); (PARI) A054429(n) = if(!n, n, ((3<<#binary(n\2))-n-1)); \\ After code in A054429 A106737(n) = sum(k=0, n, (binomial(n+k, n-k)*binomial(n, k)) % 2); A324183(n) = A106737(A054429(n)); CROSSREFS Cf. A000005, A054429, A106737, A163511, A286531, A324184, A324187. Sequence in context: A135817 A122060 A088939 * A004596 A118653 A173753 Adjacent sequences:  A324180 A324181 A324182 * A324184 A324185 A324186 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 20 22:22 EDT 2019. Contains 322310 sequences. (Running on oeis4.)