A325318 a(n) = A048250(n) AND A162296(n), where AND is the bitwise-AND, A004198.

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

Offset

1,18

Links

Antti Karttunen, Table of n, a(n) for n = 1..65537

Index entries for sequences related to binary expansion of n

Index entries for sequences related to sigma(n)

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: A189764 A297811 A359686 * A255680 A265115 A214205

Adjacent sequences: A325315 A325316 A325317 * A325319 A325320 A325321

Keyword

nonn

Author

Antti Karttunen, Apr 21 2019

Status

approved