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.

A336571 Number of sets of divisors d|n, 1 < d < n, all belonging to A130091 (numbers with distinct prime multiplicities) and forming a divisibility chain.

This page as a plain text file.
%I A336571 #18 Sep 02 2020 23:05:31
%S A336571 1,1,1,2,1,3,1,4,2,3,1,5,1,3,3,8,1,5,1,5,3,3,1,14,2,3,4,5,1,4,1,16,3,
%T A336571 3,3,17,1,3,3,14,1,4,1,5,5,3,1,36,2,5,3,5,1,14,3,14,3,3,1,16,1,3,5,32,
%U A336571 3,4,1,5,3,4,1,35,1,3,5,5,3,4,1,36,8,3,1
%N A336571 Number of sets of divisors d|n, 1 < d < n, all belonging to A130091 (numbers with distinct prime multiplicities) and forming a divisibility chain.
%C A336571 A number's prime signature (row n of A124010) is the sequence of positive exponents in its prime factorization, so a number has distinct prime multiplicities iff all the exponents in its prime signature are distinct.
%e A336571 The a(n) sets for n = 4, 6, 12, 16, 24, 84, 36:
%e A336571   {}   {}   {}     {}       {}        {}        {}
%e A336571   {2}  {2}  {2}    {2}      {2}       {2}       {2}
%e A336571        {3}  {3}    {4}      {3}       {3}       {3}
%e A336571             {4}    {8}      {4}       {4}       {4}
%e A336571             {2,4}  {2,4}    {8}       {7}       {9}
%e A336571                    {2,8}    {12}      {12}      {12}
%e A336571                    {4,8}    {2,4}     {28}      {18}
%e A336571                    {2,4,8}  {2,8}     {2,4}     {2,4}
%e A336571                             {4,8}     {2,12}    {3,9}
%e A336571                             {2,12}    {2,28}    {2,12}
%e A336571                             {3,12}    {3,12}    {2,18}
%e A336571                             {4,12}    {4,12}    {3,12}
%e A336571                             {2,4,8}   {4,28}    {3,18}
%e A336571                             {2,4,12}  {7,28}    {4,12}
%e A336571                                       {2,4,12}  {9,18}
%e A336571                                       {2,4,28}  {2,4,12}
%e A336571                                                 {3,9,18}
%t A336571 strchns[n_]:=If[n==1,1,Sum[strchns[d],{d,Select[Most[Divisors[n]],UnsameQ@@Last/@FactorInteger[#]&]}]];
%t A336571 Table[strchns[n],{n,100}]
%Y A336571 A336423 is the version for chains containing n.
%Y A336571 A336570 is the maximal version.
%Y A336571 A000005 counts divisors.
%Y A336571 A001055 counts factorizations.
%Y A336571 A007425 counts divisors of divisors.
%Y A336571 A032741 counts proper divisors.
%Y A336571 A045778 counts strict factorizations.
%Y A336571 A071625 counts distinct prime multiplicities.
%Y A336571 A074206 counts strict chains of divisors from n to 1.
%Y A336571 A130091 lists numbers with distinct prime multiplicities.
%Y A336571 A181796 counts divisors with distinct prime multiplicities.
%Y A336571 A253249 counts chains of divisors.
%Y A336571 A336422 counts divisible pairs of divisors, both in A130091.
%Y A336571 A336424 counts factorizations using A130091.
%Y A336571 A336500 counts divisors of n in A130091 with quotient also in A130091.
%Y A336571 Cf. A001222, A002033, A005117, A098859, A118914, A124010, A294068, A305149, A327498, A327523, A336568, A336569.
%K A336571 nonn
%O A336571 1,4
%A A336571 _Gus Wiseman_, Jul 29 2020