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

 

Logo
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

%I #9 Apr 22 2019 13:50:02

%S 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,

%T 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,

%U 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

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

%H Antti Karttunen, <a href="/A325318/b325318.txt">Table of n, a(n) for n = 1..65537</a>

%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>

%H <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>

%F a(n) = A004198(A048250(n), A162296(n)).

%F a(n) = A000203(n) - A325316(n) = (A000203(n) - A325317(n))/2.

%F a(n) = A325316(n) - A325317(n).

%t Array[BitAnd @@ Map[Total, {#3, Complement[#2, #3]}] & @@ {#1, #2, Select[#2, SquareFreeQ]} & @@ {#, Divisors[#]} &, 105] (* _Michael De Vlieger_, Apr 21 2019 *)

%o (PARI)

%o A048250(n) = factorback(apply(p -> p+1,factor(n)[,1]));

%o A162296(n) = sumdiv(n, d, d*(1-issquarefree(d)));

%o A325318(n) = bitand(A048250(n),A162296(n));

%Y Cf. A000203, A004198, A048250, A162296, A325316, A325317.

%K nonn

%O 1,18

%A _Antti Karttunen_, Apr 21 2019

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:59 EDT 2024. Contains 371268 sequences. (Running on oeis4.)