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.

Previous Showing 31-36 of 36 results.

A343654 Number of pairwise coprime sets of divisors > 1 of n.

Original entry on oeis.org

1, 2, 2, 3, 2, 5, 2, 4, 3, 5, 2, 8, 2, 5, 5, 5, 2, 8, 2, 8, 5, 5, 2, 11, 3, 5, 4, 8, 2, 15, 2, 6, 5, 5, 5, 13, 2, 5, 5, 11, 2, 15, 2, 8, 8, 5, 2, 14, 3, 8, 5, 8, 2, 11, 5, 11, 5, 5, 2, 25, 2, 5, 8, 7, 5, 15, 2, 8, 5, 15, 2, 18, 2, 5, 8, 8, 5, 15, 2, 14, 5, 5
Offset: 1

Views

Author

Gus Wiseman, Apr 26 2021

Keywords

Comments

First differs from A100565 at a(210) = 52, A100565(210) = 51.

Examples

			The a(n) sets for n = 1, 2, 4, 6, 8, 12, 24, 30, 32, 36, 48:
  {}  {}   {}   {}     {}   {}     {}     {}       {}    {}     {}
      {2}  {2}  {2}    {2}  {2}    {2}    {2}      {2}   {2}    {2}
           {4}  {3}    {4}  {3}    {3}    {3}      {4}   {3}    {3}
                {6}    {8}  {4}    {4}    {5}      {8}   {4}    {4}
                {2,3}       {6}    {6}    {6}      {16}  {6}    {6}
                            {12}   {8}    {10}     {32}  {9}    {8}
                            {2,3}  {12}   {15}           {12}   {12}
                            {3,4}  {24}   {30}           {18}   {16}
                                   {2,3}  {2,3}          {36}   {24}
                                   {3,4}  {2,5}          {2,3}  {48}
                                   {3,8}  {3,5}          {2,9}  {2,3}
                                          {5,6}          {3,4}  {3,4}
                                          {2,15}         {4,9}  {3,8}
                                          {3,10}                {3,16}
                                          {2,3,5}

Crossrefs

The version for partitions is A007359.
The version for subsets of {1..n} is A084422.
The case of pairs is A089233.
The version with 1's is A225520.
The maximal case is A343652.
The case without empty sets or singletons is A343653.
The maximal case without singletons is A343660.
A018892 counts pairwise coprime unordered pairs of divisors.
A051026 counts pairwise indivisible subsets of {1..n}.
A100565 counts pairwise coprime unordered triples of divisors.
A187106, A276187, and A320426 count other types of pairwise coprime sets.
A326077 counts maximal pairwise indivisible sets.
Cf. A007360, A051026, A062319, A074206, A087087, A101268, A285572, A305713, A320423, A326675, A337485, A343655.

Programs

  • Mathematica
    pwcop[y_]:=And@@(GCD@@#1==1&)/@Subsets[y,{2}];
Table[Length[Select[Subsets[Rest[Divisors[n]]],pwcop]],{n,100}]

A343659 Number of maximal pairwise coprime subsets of {1..n}.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 3, 4, 7, 9, 9, 10, 10, 12, 16, 19, 19, 20, 20, 22, 28, 32, 32, 33, 54, 61, 77, 84, 84, 85, 85, 94, 112, 123, 158, 161, 161, 176, 206, 212, 212, 214, 214, 229, 241, 260, 260, 263, 417, 428, 490, 521, 521, 526, 655, 674, 764, 818, 818, 820, 820, 874, 918, 975, 1182, 1189, 1189
Offset: 1

Views

Author

Gus Wiseman, Apr 26 2021

Keywords

Comments

For this sequence, it does not matter whether singletons are considered pairwise coprime.
For n > 2, also the number of maximal pairwise coprime subsets of {2..n}.
For each prime p <= n, p divides exactly one element of each maximal subset. - Bert Dobbelaere, May 04 2021

Examples

			The a(1) = 1 through a(9) = 7 subsets:
  {1}  {12}  {123}  {123}  {1235}  {156}   {1567}   {1567}   {1567}
                    {134}  {1345}  {1235}  {12357}  {12357}  {12357}
                                   {1345}  {13457}  {13457}  {12579}
                                                    {13578}  {13457}
                                                             {13578}
                                                             {14579}
                                                             {15789}

Links

Crossrefs

The case of pairs is A015614.
The case of triples is A015617.
The non-maximal version counting empty sets and singletons is A084422.
The non-maximal version counting singletons is A187106.
The non-maximal version is A320426(n) = A276187(n) + 1.
The version for indivisibility instead of coprimality is A326077.
The version for sets of divisors is A343652.
The version for sets of divisors > 1 is A343660.
A018892 counts coprime unordered pairs of divisors.
A051026 counts pairwise indivisible subsets of {1..n}.
A100565 counts pairwise coprime unordered triples of divisors.
Cf. A007360, A067824, A087087, A225520, A324837, A325683, A325859, A326358, A326496, A326675, A333227, A343653, A343655.

Programs

  • Mathematica
    fasmax[y_]:=Complement[y,Union@@Most@*Subsets/@y];
Table[Length[fasmax[Select[Subsets[Range[n]],CoprimeQ@@#&]]],{n,15}]

Extensions

More terms from Bert Dobbelaere, May 04 2021

A343653 Number of non-singleton pairwise coprime nonempty sets of divisors > 1 of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 1, 0, 0, 2, 0, 2, 1, 1, 0, 3, 0, 1, 0, 2, 0, 7, 0, 0, 1, 1, 1, 4, 0, 1, 1, 3, 0, 7, 0, 2, 2, 1, 0, 4, 0, 2, 1, 2, 0, 3, 1, 3, 1, 1, 0, 13, 0, 1, 2, 0, 1, 7, 0, 2, 1, 7, 0, 6, 0, 1, 2, 2, 1, 7, 0, 4, 0, 1, 0, 13, 1, 1
Offset: 1

Views

Author

Gus Wiseman, Apr 25 2021

Keywords

Comments

First differs from A066620 at a(210) = 36, A066620(210) = 35.

Examples

			The a(n) sets for n = 6, 12, 24, 30, 36, 60, 72, 96:
  {2,3}  {2,3}  {2,3}  {2,3}    {2,3}  {2,3}    {2,3}  {2,3}
         {3,4}  {3,4}  {2,5}    {2,9}  {2,5}    {2,9}  {3,4}
                {3,8}  {3,5}    {3,4}  {3,4}    {3,4}  {3,8}
                       {5,6}    {4,9}  {3,5}    {3,8}  {3,16}
                       {2,15}          {4,5}    {4,9}  {3,32}
                       {3,10}          {5,6}    {8,9}
                       {2,3,5}         {2,15}
                                       {3,10}
                                       {3,20}
                                       {4,15}
                                       {5,12}
                                       {2,3,5}
                                       {3,4,5}

Crossrefs

The case of pairs is A089233.
The version with 1's, empty sets, and singletons is A225520.
The version for subsets of {1..n} is A320426.
The version for strict partitions is A337485.
The version for compositions is A337697.
The version for prime indices is A337984.
The maximal case with 1's is A343652.
The version with empty sets is a(n) + 1.
The version with singletons is A343654(n) - 1.
The version with empty sets and singletons is A343654.
The version with 1's is A343655.
The maximal case is A343660.
A018892 counts pairwise coprime unordered pairs of divisors.
A048691 counts pairwise coprime ordered pairs of divisors.
A048785 counts pairwise coprime ordered triples of divisors.
A051026 counts pairwise indivisible subsets of {1..n}.
A100565 counts pairwise coprime unordered triples of divisors.
A305713 counts pairwise coprime non-singleton strict partitions.
A343659 counts maximal pairwise coprime subsets of {1..n}.
Cf. A007359, A067824, A074206, A076078, A084422, A187106, A285572, A324837, A326675, A327516, A338315.

Programs

  • Mathematica
    Table[Length[Select[Subsets[Rest[Divisors[n]]],CoprimeQ@@#&]],{n,100}]

A335241 Numbers whose prime indices are not pairwise coprime, where a singleton is not coprime unless it is {1}.

Original entry on oeis.org

1, 3, 5, 7, 9, 11, 13, 17, 18, 19, 21, 23, 25, 27, 29, 31, 36, 37, 39, 41, 42, 43, 45, 47, 49, 50, 53, 54, 57, 59, 61, 63, 65, 67, 71, 72, 73, 75, 78, 79, 81, 83, 84, 87, 89, 90, 91, 97, 98, 99, 100, 101, 103, 105, 107, 108, 109, 111, 113, 114, 115, 117, 121
Offset: 1

Views

Author

Gus Wiseman, May 30 2020

Keywords

Comments

We use the Mathematica definition for CoprimeQ, so a singleton is not considered coprime unless it is (1).
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

Examples

			The sequence of terms together with their prime indices begins:
    1: {}          31: {11}          61: {18}
    3: {2}         36: {1,1,2,2}     63: {2,2,4}
    5: {3}         37: {12}          65: {3,6}
    7: {4}         39: {2,6}         67: {19}
    9: {2,2}       41: {13}          71: {20}
   11: {5}         42: {1,2,4}       72: {1,1,1,2,2}
   13: {6}         43: {14}          73: {21}
   17: {7}         45: {2,2,3}       75: {2,3,3}
   18: {1,2,2}     47: {15}          78: {1,2,6}
   19: {8}         49: {4,4}         79: {22}
   21: {2,4}       50: {1,3,3}       81: {2,2,2,2}
   23: {9}         53: {16}          83: {23}
   25: {3,3}       54: {1,2,2,2}     84: {1,1,2,4}
   27: {2,2,2}     57: {2,8}         87: {2,10}
   29: {10}        59: {17}          89: {24}

Crossrefs

The complement is A302696.
The version for relatively prime instead of coprime is A318978.
The version for standard compositions is A335239.
These are the Heinz numbers of the partitions counted by A335240.
Singleton or pairwise coprime partitions are counted by A051424.
Singleton or pairwise coprime sets are ranked by A087087.
Primes and numbers with pairwise coprime prime indices are A302569.
Numbers whose binary indices are pairwise coprime are A326675.
Coprime standard composition numbers are A333227.
Cf. A007360, A101268, A326674, A327516, A333228, A335236, A335237, A335238.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],!CoprimeQ@@primeMS[#]&]

A368531 Numbers whose binary indices are all powers of 3, where a binary index of n (row n of A048793) is any position of a 1 in its reversed binary expansion.

Original entry on oeis.org

0, 1, 4, 5, 256, 257, 260, 261, 67108864, 67108865, 67108868, 67108869, 67109120, 67109121, 67109124, 67109125, 1208925819614629174706176, 1208925819614629174706177, 1208925819614629174706180, 1208925819614629174706181, 1208925819614629174706432
Offset: 1

Views

Author

Gus Wiseman, Dec 29 2023

Keywords

Comments

For powers of 2 instead of 3 we have A253317.

Examples

			The terms together with their binary expansions and binary indices begin:
         0:                           0 ~ {}
         1:                           1 ~ {1}
         4:                         100 ~ {3}
         5:                         101 ~ {1,3}
       256:                   100000000 ~ {9}
       257:                   100000001 ~ {1,9}
       260:                   100000100 ~ {3,9}
       261:                   100000101 ~ {1,3,9}
  67108864: 100000000000000000000000000 ~ {27}
  67108865: 100000000000000000000000001 ~ {1,27}
  67108868: 100000000000000000000000100 ~ {3,27}
  67108869: 100000000000000000000000101 ~ {1,3,27}
  67109120: 100000000000000000100000000 ~ {9,27}
  67109121: 100000000000000000100000001 ~ {1,9,27}
  67109124: 100000000000000000100000100 ~ {3,9,27}
  67109125: 100000000000000000100000101 ~ {1,3,9,27}

Links

Crossrefs

A000244 lists powers of 3.
A048793 lists binary indices, length A000120, sum A029931.
A070939 gives length of binary expansion.
A096111 gives product of binary indices.
Cf. A058891, A062050, A072639, A253317, A326031, A326675, A326702, A367912, A368183, A368109.

Programs

  • Mathematica
    Select[Range[0,10000],IntegerQ[Log[3,Times@@Join@@Position[Reverse[IntegerDigits[#,2]],1]]]&]
(* Second program *)
{0}~Join~Array[FromDigits[Reverse@ ReplacePart[ConstantArray[0, Max[#]], Map[# -> 1 &, #]], 2] &[3^(Position[Reverse@ IntegerDigits[#, 2], 1][[;; , 1]] - 1)] &, 255] (* Michael De Vlieger, Dec 29 2023 *)

Formula

a(3^n) = 2^(3^n - 1).

A327905 FDH numbers of pairwise coprime sets.

Original entry on oeis.org

2, 6, 8, 10, 12, 14, 18, 20, 21, 22, 24, 26, 28, 32, 33, 34, 35, 38, 40, 42, 44, 46, 48, 50, 52, 55, 56, 57, 58, 62, 63, 66, 68, 70, 74, 75, 76, 77, 80, 82, 84, 86, 88, 91, 93, 94, 95, 96, 98, 99, 100, 104, 106, 110, 112, 114, 116, 118, 122, 123, 125, 126, 132
Offset: 1

Views

Author

Gus Wiseman, Sep 30 2019

Keywords

Comments

Let f(n) = A050376(n) be the n-th Fermi-Dirac prime. The FDH-number of a strict partition or finite set {y_1,...,y_k} is f(y_1)*...*f(y_k).
We use the Mathematica function CoprimeQ, meaning a singleton is not coprime unless it is {1}.

Examples

			The sequence of terms together with their corresponding coprime sets begins:
   2: {1}
   6: {1,2}
   8: {1,3}
  10: {1,4}
  12: {2,3}
  14: {1,5}
  18: {1,6}
  20: {3,4}
  21: {2,5}
  22: {1,7}
  24: {1,2,3}
  26: {1,8}
  28: {3,5}
  32: {1,9}
  33: {2,7}
  34: {1,10}
  35: {4,5}
  38: {1,11}
  40: {1,3,4}
  42: {1,2,5}

Links

  • Wolfram Language Documentation, CoprimeQ

Crossrefs

Heinz numbers of pairwise coprime partitions are A302696 (all), A302797 (strict), A302569 (with singletons), and A302798 (strict with singletons).
FDH numbers of relatively prime sets are A319827.
Cf. A050376, A056239, A064547, A213925, A259936, A299755, A299757, A304711, A319826, A326675.

Programs

  • Mathematica
    FDfactor[n_]:=If[n==1,{},Sort[Join@@Cases[FactorInteger[n],{p_,k_}:>Power[p,Cases[Position[IntegerDigits[k,2]//Reverse,1],{m_}->2^(m-1)]]]]];
nn=100;FDprimeList=Array[FDfactor,nn,1,Union];
FDrules=MapIndexed[(#1->#2[[1]])&,FDprimeList];
Select[Range[nn],CoprimeQ@@(FDfactor[#]/.FDrules)&]
Previous Showing 31-36 of 36 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.