cp's OEIS Frontend

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.

A328043 Number of divisors of the amicable pairs.

This page as a plain text file.
%I A328043 #40 Oct 17 2019 02:00:48
%S A328043 12,6,12,12,12,12,12,12,16,12,16,16,32,16,20,10,24,12,20,20,32,32,48,
%T A328043 24,32,16,48,24,48,24,20,20,24,16,32,16,20,20,20,20,32,16,24,24,36,12,
%U A328043 24,12,48,16,32,16,20,20,18,36,20,20,48,48,32,16,32,16,32,16,32,16,32,16,48,24,32,16,48,32,24,20
%N A328043 Number of divisors of the amicable pairs.
%H A328043 Amiram Eldar, <a href="/A328043/b328043.txt">Table of n, a(n) for n = 1..20000</a>
%F A328043 a(n) = A000005(A259180(n)).
%e A328043 Consider the first amicable pair [220, 284]. The smaller member has 12 divisors, they are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, 220. The larger member has 6 divisors, they are 1, 2, 4, 71, 142, 284. So a(1) = 12 and a(2) = 6.
%t A328043 With[{s = Array[{#, DivisorSigma[1, #] - #} &, 10^5]}, DivisorSigma[0, #] &@ Flatten@ DeleteDuplicates[Sort /@ Select[Reverse /@ s, And[! FreeQ[s, #], UnsameQ @@ #] &]]] (* _Michael De Vlieger_, Oct 08 2019 *)
%Y A328043 Row lengths of A328009.
%Y A328043 Cf. A000005, A259180, A328063, A328064, A328065.
%K A328043 nonn
%O A328043 1,1
%A A328043 _Omar E. Pol_, Oct 02 2019