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!)
 A325318 a(n) = A048250(n) AND A162296(n), where AND is the bitwise-AND, A004198. 3
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 16, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 32, 16, 0, 0, 0, 0, 2, 0, 40, 0, 12, 0, 0, 0, 0, 0, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 16, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 64, 0, 0, 0, 0, 0, 16, 32, 2, 0, 0, 0, 40, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,18 LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(n) = A004198(A048250(n), A162296(n)). a(n) = A000203(n) - A325316(n) = (A000203(n) - A325317(n))/2. a(n) = A325316(n) - A325317(n). MATHEMATICA Array[BitAnd @@ Map[Total, {#3, Complement[#2, #3]}] & @@ {#1, #2, Select[#2, SquareFreeQ]} & @@ {#, Divisors[#]} &, 105] (* Michael De Vlieger, Apr 21 2019 *) PROG (PARI) A048250(n) = factorback(apply(p -> p+1, factor(n)[, 1])); A162296(n) = sumdiv(n, d, d*(1-issquarefree(d))); A325318(n) = bitand(A048250(n), A162296(n)); CROSSREFS Cf. A000203, A004198, A048250, A162296, A325316, A325317. Sequence in context: A077062 A189764 A297811 * A255680 A265115 A214205 Adjacent sequences:  A325315 A325316 A325317 * A325319 A325320 A325321 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 23 07:07 EST 2020. Contains 331168 sequences. (Running on oeis4.)