cp's OEIS Frontend

A323248 a(n) = A323247(n) - A323243(n).

%I A323248 #8 Jan 11 2019 20:37:01
%S A323248 0,0,0,0,0,2,0,3,-2,3,0,7,0,14,0,2,0,9,0,15,-5,16,0,18,-6,44,1,19,0,7,
%T A323248 0,25,12,80,-4,10,0,254,-14,18,0,33,0,63,5,224,0,41,-14,16,6,127,0,24,
%U A323248 -21,66,-14,746,0,38,0,1360,13,16,8,39,0,211,252,37,0,33,0,3836,7,403,-12,103,0,73,-16,5456,0,22,-74,12248,-350,26,0,8
%N A323248 a(n) = A323247(n) - A323243(n).
%H A323248 Antti Karttunen, <a href="/A323248/b323248.txt">Table of n, a(n) for n = 1..3445</a>
%H A323248 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A323248 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A323248 a(n) = A323247(n) - A323243(n).
%F A323248 a(n) = A323244(n) - A001222(n).
%F A323248 For n > 1, a(n) = A294898(A156552(n)).
%o A323248 (PARI)
%o A323248 A005187(n) = { my(s=n); while(n>>=1, s+=n); s; };
%o A323248 A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
%o A323248 A156552(n) = if(1==n, 0, if(!(n%2), 1+(2*A156552(n/2)), 2*A156552(A064989(n))));
%o A323248 A323247(n) = A005187(A156552(n));
%o A323248 A323248(n) = (A323247(n) - A323243(n));
%Y A323248 Cf. A005187, A156552, A323243, A323246, A323247.
%Y A323248 Cf. also A323167.
%K A323248 sign
%O A323248 1,6
%A A323248 _Antti Karttunen_, Jan 10 2019