The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A325310 a(n) = A001511(A325315(n)), except when A325315(n) = 0, then a(n) = 0. 3
 1, 1, 2, 1, 3, 0, 2, 1, 1, 2, 2, 3, 3, 3, 2, 1, 5, 1, 2, 2, 2, 4, 2, 3, 1, 2, 2, 0, 3, 3, 2, 1, 2, 2, 2, 1, 3, 5, 2, 2, 4, 3, 2, 3, 3, 3, 2, 3, 1, 1, 2, 2, 3, 3, 2, 4, 2, 2, 2, 4, 3, 3, 2, 1, 2, 3, 2, 2, 2, 3, 2, 1, 4, 2, 2, 3, 2, 3, 2, 2, 1, 2, 2, 6, 2, 4, 2, 3, 4, 2, 2, 5, 2, 3, 2, 3, 6, 1, 2, 1, 3, 3, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA If A325315(n) = 0, then a(n) = 0, otherwise a(n) = A001511(A325315(n)). a(A228058(n)) = A001511(abs(A325379(n))), assuming there are no odd perfect numbers, in which case a(A228058(n)) >= 3 for all n. MATHEMATICA Array[If[# == 0, 0, IntegerExponent[2 #, 2]] &[BitXor @@ Abs[#1 - Map[Total, {#3, Complement[#2, #3]}]]] & @@ {#1, #2, Select[#2, SquareFreeQ]} & @@ {#, Divisors[#]} &, 105] (* Michael De Vlieger, Apr 21 2019 *) PROG (PARI) A001511ext(n) = if(!n, n, sign(n)*(1+valuation(n, 2))); \\ Like A001511 but gives 0 for 0 and -A001511(-n) for negative numbers. A048250(n) = factorback(apply(p -> p+1, factor(n)[, 1])); A325313(n) = (A048250(n) - n); A162296(n) = sumdiv(n, d, d*(1-issquarefree(d))); A325314(n) = (n - A162296(n)); A325315(n) = bitxor(abs(A325313(n)), abs(A325314(n))); A325310(n) = A001511ext(A325315(n)); CROSSREFS Cf. A000396, A001511, A028982 (gives the positions of 1's), A048250, A162296, A228058, A325313, A325314, A325315, A325378, A325379. Sequence in context: A321377 A071467 A125073 * A308881 A281488 A071461 Adjacent sequences:  A325307 A325308 A325309 * A325311 A325312 A325313 KEYWORD nonn AUTHOR Antti Karttunen, Apr 21 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 January 20 11:11 EST 2020. Contains 331083 sequences. (Running on oeis4.)