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.

A327591 Number of subsets of {1..n} containing no quotients of pairs of distinct elements.

Original entry on oeis.org

1, 2, 3, 5, 7, 13, 23, 45, 89, 137, 253, 505, 897, 1793, 3393, 6353, 9721, 19441, 35665, 71329, 129953, 247233, 477665, 955329, 1700417, 2657281, 5184001, 10368001, 19407361, 38814721, 68868353, 137736705, 260693505, 505830401, 999641601, 1882820609, 2807196673
Offset: 0

Views

Author

Peter Kagey, Sep 17 2019

Keywords

Examples

			The a(0) = 1 through a(5) = 13 subsets:
  {}  {}   {}   {}     {}     {}
      {1}  {1}  {1}    {1}    {1}
           {2}  {2}    {2}    {2}
                {3}    {3}    {3}
                {2,3}  {4}    {4}
                       {2,3}  {5}
                       {3,4}  {2,3}
                              {2,5}
                              {3,4}
                              {3,5}
                              {4,5}
                              {2,3,5}
                              {3,4,5}
		

Crossrefs

Maximal subsets without quotients are A326492.
Subsets with quotients are A326023.
Subsets without differences or quotients are A326490.
Subsets without products are A326489.

Formula

A326489(n) + 1 for n > 0.