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.

A326117 Number of subsets of {1..n} containing no products of two or more distinct elements.

Original entry on oeis.org

1, 2, 3, 5, 9, 17, 29, 57, 101, 201, 365, 729, 1233, 2465, 4593, 8297, 15921, 31841, 55953, 111905, 195713, 362337, 697361, 1394721, 2334113, 4668225, 9095393, 17225313, 31242785, 62485569, 106668609, 213337217, 392606529, 755131841, 1491146913, 2727555425, 4947175713
Offset: 0

Views

Author

Gus Wiseman, Jun 06 2019

Keywords

Comments

If this sequence counts product-free sets, A326081 counts product-closed sets.

Examples

			The a(6) = 28 sets:
  {}  {1}  {2,3}  {2,3,4}  {2,3,4,5}
      {2}  {2,4}  {2,3,5}  {2,4,5,6}
      {3}  {2,5}  {2,4,5}  {3,4,5,6}
      {4}  {2,6}  {2,4,6}
      {5}  {3,4}  {2,5,6}
      {6}  {3,5}  {3,4,5}
           {3,6}  {3,4,6}
           {4,5}  {3,5,6}
           {4,6}  {4,5,6}
           {5,6}
		

Crossrefs

Programs

  • Mathematica
    Table[Length[Select[Subsets[Range[n]],Intersection[#,Select[Times@@@Subsets[#,{2}],#<=n&]]=={}&]],{n,0,20}]

Formula

For n > 0, a(n) = A326116(n) + 1.

Extensions

Terms a(21)-a(36) from Andrew Howroyd, Aug 30 2019