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.

A370591 Number of minimal subsets of {1..n} such that it is not possible to choose a different prime factor of each element (non-choosable).

Original entry on oeis.org

0, 1, 1, 1, 2, 2, 4, 4, 7, 11, 16, 16, 30, 30, 39, 73
Offset: 0

Views

Author

Gus Wiseman, Feb 28 2024

Keywords

Examples

			The a(1) = 1 through a(10) = 16 subsets:
{1}  {1}  {1}  {1}    {1}    {1}      {1}      {1}      {1}      {1}
               {2,4}  {2,4}  {2,4}    {2,4}    {2,4}    {2,4}    {2,4}
                             {2,3,6}  {2,3,6}  {2,8}    {2,8}    {2,8}
                             {3,4,6}  {3,4,6}  {4,8}    {3,9}    {3,9}
                                               {2,3,6}  {4,8}    {4,8}
                                               {3,4,6}  {2,3,6}  {2,3,6}
                                               {3,6,8}  {2,6,9}  {2,6,9}
                                                        {3,4,6}  {3,4,6}
                                                        {3,6,8}  {3,6,8}
                                                        {4,6,9}  {4,6,9}
                                                        {6,8,9}  {6,8,9}
                                                                 {2,5,10}
                                                                 {4,5,10}
                                                                 {5,8,10}
                                                                 {3,5,6,10}
                                                                 {5,6,9,10}
		

Crossrefs

Minimal case of A370583, complement A370582.
For binary indices instead of factors we have A370642, minima of A370637.
A006530 gives greatest prime factor, least A020639.
A027746 lists prime factors, indices A112798, length A001222.
A355741 counts choices of a prime factor of each prime index.
A367902 counts choosable set-systems, ranks A367906, unlabeled A368095.
A367903 counts non-choosable set-systems, ranks A367907, unlabeled A368094.
A368098 counts choosable unlabeled multiset partitions, complement A368097.
A368100 ranks choosable multisets, complement A355529.
A368414 counts choosable factorizations, complement A368413.
A370585 counts maximal choosable sets.
A370592 counts choosable partitions, complement A370593.

Programs

  • Mathematica
    Table[Length[fasmin[Select[Subsets[Range[n]], Length[Select[Tuples[prix/@#],UnsameQ@@#&]]==0&]]], {n,0,15}]