# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a353567
Showing 1-1 of 1

%I A353567 #7 Apr 29 2022 15:55:43
%S A353567 1,2,1,2,1,2,1,2,2,2,1,3,1,2,1,2,1,4,1,2,1,2,1,3,1,2,2,2,1,2,1,2,1,2,
%T A353567 1,6,1,2,1,3,1,2,1,2,2,2,1,3,1,2,1,2,1,4,1,2,1,2,1,4,1,2,2,2,1,2,1,2,
%U A353567 1,2,1,6,1,2,1,2,1,2,1,3,2,2,1,4,1,2,1,2,1,4,1,2,1,2,1,3,1,2,2,2,1,2,1,2,1,2,1,6
%N A353567 Number of divisors d of n such that d is a multiple of its prime shadow A181819(d).
%C A353567 Number of terms of A325755 that divide n.
%H A353567 Antti Karttunen, <a href="/A353567/b353567.txt">Table of n, a(n) for n = 1..65537</a>
%F A353567 a(n) = Sum_{d|n} A353566(d).
%o A353567 (PARI)
%o A353567 A353566(n) = (0==(n%factorback(apply(e->prime(e),(factor(n)[,2])))));
%o A353567 A353567(n) = sumdiv(n,d,A353566(d));
%Y A353567 Inverse Möbius transform of A353566.
%Y A353567 Cf. A181819, A325755.
%K A353567 nonn
%O A353567 1,2
%A A353567 _Antti Karttunen_, Apr 29 2022

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE