This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A323879 #6 Feb 08 2019 00:10:21
%S A323879 0,1,0,1,0,2,0,1,0,1,0,3,0,1,0,1,0,2,0,1,0,1,0,4,0,1,0,1,0,3,0,1,0,1,
%T A323879 0,3,0,1,0,1,0,2,0,2,0,1,0,4,0,1,0,1,0,2,0,1,0,1,0,5,0,1,0,1,0,2,0,1,
%U A323879 0,2,0,5,0,1,0,1,0,2,0,1,0,1,0,3,0,1,0,2,0,4,0,1,0,1,0,4,0,1,0,1,0,2,0,1,0
%N A323879 Number of divisors d of n such that A276154(d) divides n.
%H A323879 Antti Karttunen, <a href="/A323879/b323879.txt">Table of n, a(n) for n = 1..30030</a>
%H A323879 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A323879 a(n) = Sum_{d|n} [A276154(d)|n], where [ ] is the Iverson bracket.
%o A323879 (PARI)
%o A323879 A276151(n) = { my(s=1); forprime(p=2, , if(n%p, return(n-s), s *= p)); };
%o A323879 A276152(n) = { my(s=1); forprime(p=2, , if(n%p, return(s*p), s *= p)); };
%o A323879 A276154(n) = if(!n,n,(A276152(n) + A276154(A276151(n))));
%o A323879 A323879(n) = sumdiv(n,d,!(n%A276154(d)));
%Y A323879 Cf. A002110, A276154.
%Y A323879 Cf. also A323878.
%K A323879 nonn,base
%O A323879 1,6
%A A323879 _Antti Karttunen_, Feb 07 2019