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 11-20 of 46 results. Next

A337605 Number of unordered triples of distinct positive integers summing to n, any two of which have a common divisor > 1.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 2, 0, 4, 0, 4, 1, 5, 0, 9, 0, 8, 3, 10, 0, 17, 1, 14, 5, 16, 1, 25, 1, 21, 8, 26, 2, 37, 1, 30, 15, 33, 2, 49, 2, 44, 16, 44, 2, 64, 6, 54, 21, 56, 3, 87, 5, 65, 30, 70, 9, 101, 5, 80, 34, 98, 6, 121, 6, 96, 52
Offset: 0

Views

Author

Gus Wiseman, Sep 20 2020

Keywords

Examples

			The a(n) triples for n = 12, 16, 18, 22, 27, 55:
  (6,4,2)  (8,6,2)   (8,6,4)   (10,8,4)  (12,9,6)  (28,21,6)
           (10,4,2)  (9,6,3)   (12,6,4)  (15,9,3)  (30,20,5)
                     (10,6,2)  (12,8,2)  (18,6,3)  (35,15,5)
                     (12,4,2)  (14,6,2)            (40,10,5)
                               (16,4,2)            (25,20,10)
                                                   (30,15,10)
		

Crossrefs

A014612 intersected with A318719 ranks these partitions.
A220377 is the coprime instead of non-coprime version.
A318717 counts these partitions of any length, ranked by A318719.
A337599 is the non-strict version.
A337604 is the ordered non-strict version.
A337605*6 is the ordered version.
A023023 counts relatively prime 3-part partitions
A051424 counts pairwise coprime or singleton partitions.
A200976 and A328673 count pairwise non-coprime partitions.
A307719 counts pairwise coprime 3-part partitions.
A327516 counts pairwise coprime partitions, with strict case A305713.

Programs

  • Mathematica
    stabQ[u_,Q_]:=Array[#1==#2||!Q[u[[#1]],u[[#2]]]&,{Length[u],Length[u]},1,And];
    Table[Length[Select[IntegerPartitions[n,{3}],UnsameQ@@#&&stabQ[#,CoprimeQ]&]],{n,0,100}]

A055684 Number of different n-pointed stars.

Original entry on oeis.org

0, 0, 1, 0, 2, 1, 2, 1, 4, 1, 5, 2, 3, 3, 7, 2, 8, 3, 5, 4, 10, 3, 9, 5, 8, 5, 13, 3, 14, 7, 9, 7, 11, 5, 17, 8, 11, 7, 19, 5, 20, 9, 11, 10, 22, 7, 20, 9, 15, 11, 25, 8, 19, 11, 17, 13, 28, 7, 29, 14, 17, 15, 23, 9, 32, 15, 21, 11, 34, 11, 35, 17, 19, 17, 29, 11
Offset: 3

Views

Author

Robert G. Wilson v, Jun 09 2000

Keywords

Comments

Does not count rotations or reflections.
This is also the distinct ways of writing a number as the sum of two positive integers greater than one that are coprimes. - Lei Zhou, Mar 19 2014
Equivalently, a(n) is the number of relatively prime 2-part partitions of n without 1's. The Heinz numbers of these partitions are the intersection of A001358 (pairs), A005408 (no 1's), and A000837 (relatively prime) or A302696 (pairwise coprime). - Gus Wiseman, Oct 28 2020

Examples

			The first star has five points and is unique. The next is the seven pointed star and it comes in two varieties.
From _Gus Wiseman_, Oct 28 2020: (Start)
The a(5) = 1 through a(17) = 7 irreducible pairs > 1 (shown as fractions, empty column indicated by dot):
  2/3  .  2/5  3/5  2/7  3/7  2/9  5/7  2/11  3/11  2/13  3/13  2/15
          3/4       4/5       3/8       3/10  5/9   4/11  5/11  3/14
                              4/7       4/9         7/8   7/9   4/13
                              5/6       5/8                     5/12
                                        6/7                     6/11
                                                                7/10
                                                                8/9
(End)
		

References

  • Mark A. Herkommer, "Number Theory, A Programmer's Guide," McGraw-Hill, New York, 1999, page 58.

Crossrefs

Cf. A023022.
Cf. A053669 smallest skip increment, A102302 skip increment of densest star polygon.
A055684*2 is the ordered version.
A082023 counts the complement (reducible pairs > 1).
A220377, A337563, and A338332 count triples instead of pairs.
A000837 counts relatively prime partitions, with strict case A078374.
A002865 counts partitions with no 1's, with strict case A025147.
A007359 and A337485 count pairwise coprime partitions with no 1's.
A302698 counts relatively prime partitions with no 1's, with strict case A337452.
A327516 counts pairwise coprime partitions, with strict case A305713.
A337450 counts relatively prime compositions with no 1's, with strict case A337451.

Programs

  • Maple
    with(numtheory): A055684 := n->(phi(n)-2)/2; seq(A055684(n), n=3..100);
  • Mathematica
    Table[(EulerPhi[n]-2)/2, {n, 3, 50}]
    Table[Length[Select[IntegerPartitions[n,{2}],!MemberQ[#,1]&&CoprimeQ@@#&]],{n,0,30}] (* Gus Wiseman, Oct 28 2020 *)

Formula

a(n) = A023022(n) - 1.
a(n) + A082023(n) = A140106(n). - Gus Wiseman, Oct 28 2020

A337563 Number of pairwise coprime unordered triples of positive integers > 1 summing to n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 2, 1, 4, 0, 7, 1, 7, 3, 9, 2, 15, 3, 13, 5, 17, 4, 29, 5, 20, 8, 28, 8, 42, 8, 31, 14, 42, 10, 59, 12, 45, 21, 52, 14, 77, 17, 68, 26, 69, 19, 101, 26, 84, 34, 86, 25, 138, 28, 95, 43, 111, 36, 161, 35, 118, 52, 151
Offset: 0

Views

Author

Gus Wiseman, Sep 21 2020

Keywords

Comments

Such partitions are necessarily strict.
The Heinz numbers of these partitions are the intersection of A005408 (no 1's), A014612 (triples), and A302696 (coprime).

Examples

			The a(10) = 1 through a(24) = 15 triples (empty columns indicated by dots, A..J = 10..19):
  532  .  543  .  743  753  754  .  765  B53  875  975  985  B75  987
          732     752       853     873       974  B73  B65  D73  B76
                            952     954       A73  D53  B74       B85
                            B32     972       B54       B83       B94
                                    B43       B72       B92       BA3
                                    B52       D43       D54       C75
                                    D32       D52       D72       D65
                                                        E53       D74
                                                        H32       D83
                                                                  D92
                                                                  F72
                                                                  G53
                                                                  H43
                                                                  H52
                                                                  J32
		

Crossrefs

A055684 is the version for pairs.
A220377 allows 1's, with non-strict version A307719.
A337485 counts these partitions of any length.
A337563*6 is the ordered version.
A001399(n - 3) = A069905(n) = A211540(n + 2) counts 3-part partitions.
A002865 counts partitions with no 1's, with strict case A025147.
A007359 counts pairwise coprime partitions with no 1's.
A078374 counts relatively prime strict partitions.
A200976 and A328673 count pairwise non-coprime partitions.
A302696 ranks pairwise coprime partitions.
A302698 counts relatively prime partitions with no 1's.
A305713 counts pairwise coprime strict partitions.
A327516 counts pairwise coprime partitions.
A337452 counts relatively prime strict partitions with no 1's.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n,{3}],!MemberQ[#,1]&&CoprimeQ@@#&]],{n,0,30}]

A337604 Number of ordered triples of positive integers summing to n, any two of which have a common divisor > 1.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 0, 3, 1, 6, 0, 13, 0, 15, 7, 21, 0, 37, 0, 39, 16, 45, 0, 73, 6, 66, 28, 81, 0, 130, 6, 105, 46, 120, 21, 181, 6, 153, 67, 189, 12, 262, 6, 213, 118, 231, 12, 337, 21, 306, 121, 303, 12, 433, 57, 369, 154, 378, 18, 583, 30, 435, 217, 465
Offset: 0

Views

Author

Gus Wiseman, Sep 20 2020

Keywords

Comments

The first relatively prime triple (15,10,6) is counted under a(31).

Examples

			The a(6) = 1 through a(15) = 7 triples (empty columns indicated by dots, A = 10):
  222  .  224  333  226  .  228  .  22A  339
          242       244     246     248  366
          422       262     264     266  393
                    424     282     284  555
                    442     336     2A2  636
                    622     363     428  663
                            426     446  933
                            444     464
                            462     482
                            624     626
                            633     644
                            642     662
                            822     824
                                    842
                                    A22
		

Crossrefs

A014311 intersected with A337666 ranks these compositions.
A337667 counts these compositions of any length.
A335402 lists the positions of zeros.
A337461 is the coprime instead of non-coprime version.
A337599 is the unordered version, with strict case A337605.
A337605*6 is the strict version.
A000741 counts relatively prime 3-part compositions.
A101268 counts pairwise coprime or singleton compositions.
A200976 and A328673 count pairwise non-relatively prime partitions.
A307719 counts pairwise coprime 3-part partitions.
A318717 counts pairwise non-coprime strict partitions.
A333227 ranks pairwise coprime compositions.

Programs

  • Mathematica
    stabQ[u_,Q_]:=Array[#1==#2||!Q[u[[#1]],u[[#2]]]&,{Length[u],Length[u]},1,And];
    Table[Length[Select[Join@@Permutations/@IntegerPartitions[n,{3}],stabQ[#,CoprimeQ]&]],{n,0,100}]

A318715 Number of strict integer partitions of n with relatively prime parts in which no two parts are relatively prime.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 2, 0, 0, 0, 2, 0, 2, 0, 1, 0, 4, 0, 3, 0, 1, 0, 5, 0, 8, 0, 2, 0, 5, 0, 10, 0, 4, 0, 13, 0, 15, 0, 3, 1, 13, 0, 19, 0, 9, 1, 24, 0, 20
Offset: 1

Views

Author

Gus Wiseman, Sep 02 2018

Keywords

Examples

			The a(67) = 10 strict integer partitions are
  (45,12,10) (42,15,10) (40,15,12) (33,22,12) (28,21,18)
  (36,15,10,6) (30,15,12,10) (28,21,12,6) (24,18,15,10)
  (24,15,12,10,6).
		

Crossrefs

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],And[UnsameQ@@#,GCD@@#==1,And@@(GCD[##]>1&)@@@Select[Tuples[#,2],Less@@#&]]&]],{n,50}]

Extensions

a(71)-a(85) from Robert Price, Sep 08 2018

A337599 Number of unordered triples of positive integers summing to n, any two of which have a common divisor > 1.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 0, 4, 0, 4, 3, 5, 0, 9, 0, 9, 5, 10, 0, 16, 2, 14, 7, 17, 0, 27, 1, 21, 11, 24, 6, 36, 1, 30, 15, 37, 2, 51, 1, 41, 25, 44, 2, 64, 5, 58, 25, 57, 2, 81, 13, 69, 31, 70, 3, 108, 5, 80, 43, 85, 17, 123, 5, 97, 46, 120, 6, 144, 6
Offset: 0

Views

Author

Gus Wiseman, Sep 20 2020

Keywords

Comments

First differs from A082024 at a(31) = 1, A082024(31) = 0.
The first relatively prime triple is (15,10,6), counted under a(31).

Examples

			The a(6) = 1 through a(16) = 5 partitions are (empty columns indicated by dots, A..G = 10..16):
  222  .  422  333  442  .  444  .  644  555  664  .  666  .  866
                    622     633     662  663  844     864     884
                            642     842  933  862     882     A55
                            822     A22       A42     963     A64
                                              C22     A44     A82
                                                      A62     C44
                                                      C33     C62
                                                      C42     E42
                                                      E22     G22
		

Crossrefs

A014612 intersected with A337694 ranks these partitions.
A200976 and A328673 count these partitions of any length.
A284825 is the case that is also relatively prime.
A307719 is the pairwise coprime instead of non-coprime version.
A335402 gives the positions of zeros.
A337604 is the ordered version.
A337605 is the strict case.
A051424 counts pairwise coprime or singleton partitions.
A101268 counts pairwise coprime or singleton compositions.
A305713 counts strict pairwise coprime partitions.
A327516 counts pairwise coprime partitions.
A333227 ranks pairwise coprime compositions.
A333228 ranks compositions whose distinct parts are pairwise coprime.

Programs

  • Mathematica
    stabQ[u_,Q_]:=Array[#1==#2||!Q[u[[#1]],u[[#2]]]&,{Length[u],Length[u]},1,And];
    Table[Length[Select[IntegerPartitions[n,{3}],stabQ[#,CoprimeQ]&]],{n,0,100}]

A318719 Heinz numbers of strict integer partitions in which no two parts are relatively prime.

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 13, 17, 19, 21, 23, 29, 31, 37, 39, 41, 43, 47, 53, 57, 59, 61, 65, 67, 71, 73, 79, 83, 87, 89, 91, 97, 101, 103, 107, 109, 111, 113, 115, 127, 129, 131, 133, 137, 139, 149, 151, 157, 159, 163, 167, 173, 179, 181, 183, 185, 191, 193, 197
Offset: 1

Views

Author

Gus Wiseman, Sep 02 2018

Keywords

Comments

The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).

Crossrefs

Programs

  • Mathematica
    Select[Range[200],And[SquareFreeQ[#],And@@(GCD[##]>1&)@@@Select[Tuples[PrimePi/@FactorInteger[#][[All,1]],2],Less@@#&]]&]

A337603 Number of ordered triples of positive integers summing to n whose set of distinct parts is pairwise coprime, where a singleton is not considered coprime unless it is (1).

Original entry on oeis.org

0, 0, 0, 1, 3, 6, 9, 9, 18, 15, 24, 21, 42, 24, 51, 30, 54, 42, 93, 45, 102, 54, 99, 69, 162, 66, 150, 87, 168, 96, 264, 93, 228, 120, 246, 126, 336, 132, 315, 168, 342, 162, 486, 165, 420, 216, 411, 213, 618, 207, 558, 258, 540, 258, 783, 264, 654, 324, 660
Offset: 0

Views

Author

Gus Wiseman, Sep 20 2020

Keywords

Examples

			The a(3) = 1 through a(8) = 18 triples:
  (1,1,1)  (1,1,2)  (1,1,3)  (1,1,4)  (1,1,5)  (1,1,6)
           (1,2,1)  (1,2,2)  (1,2,3)  (1,3,3)  (1,2,5)
           (2,1,1)  (1,3,1)  (1,3,2)  (1,5,1)  (1,3,4)
                    (2,1,2)  (1,4,1)  (2,2,3)  (1,4,3)
                    (2,2,1)  (2,1,3)  (2,3,2)  (1,5,2)
                    (3,1,1)  (2,3,1)  (3,1,3)  (1,6,1)
                             (3,1,2)  (3,2,2)  (2,1,5)
                             (3,2,1)  (3,3,1)  (2,3,3)
                             (4,1,1)  (5,1,1)  (2,5,1)
                                               (3,1,4)
                                               (3,2,3)
                                               (3,3,2)
                                               (3,4,1)
                                               (4,1,3)
                                               (4,3,1)
                                               (5,1,2)
                                               (5,2,1)
                                               (6,1,1)
		

Crossrefs

A014311 intersected with A333228 ranks these compositions.
A220377*6 is the strict case.
A337461 is the strict case except for any number of 1's.
A337601 is the unordered version.
A337602 considers all singletons to be coprime.
A337665 counts these compositions of any length, ranked by A333228 with complement A335238.
A000217(n - 2) counts 3-part compositions.
A001399(n - 3) = A069905(n) = A211540(n + 2) counts 3-part partitions.
A007318 and A097805 count compositions by length.
A051424 counts pairwise coprime or singleton partitions.
A101268 counts pairwise coprime or singleton compositions.
A304711 ranks partitions whose distinct parts are pairwise coprime.
A305713 counts strict pairwise coprime partitions.
A327516 counts pairwise coprime partitions, with strict case A305713.
A333227 ranks pairwise coprime compositions.

Programs

  • Mathematica
    Table[Length[Select[Join@@Permutations/@IntegerPartitions[n,{3}],CoprimeQ@@Union[#]&]],{n,0,100}]

A337562 Number of pairwise coprime strict compositions of n, where a singleton is always considered coprime.

Original entry on oeis.org

1, 1, 1, 3, 3, 5, 9, 7, 17, 13, 23, 41, 41, 67, 49, 75, 75, 155, 211, 229, 243, 241, 287, 395, 807, 537, 841, 655, 1147, 1619, 2037, 2551, 2213, 2007, 2663, 4579, 4171, 7123, 4843, 6013, 6215, 11639, 13561, 16489, 14739, 15445, 16529, 25007, 41003, 32803
Offset: 0

Views

Author

Gus Wiseman, Sep 20 2020

Keywords

Examples

			The a(1) = 1 through a(9) = 12 compositions:
  (1)  (2)  (3)    (4)    (5)    (6)      (7)    (8)      (9)
            (1,2)  (1,3)  (1,4)  (1,5)    (1,6)  (1,7)    (1,8)
            (2,1)  (3,1)  (2,3)  (5,1)    (2,5)  (3,5)    (2,7)
                          (3,2)  (1,2,3)  (3,4)  (5,3)    (4,5)
                          (4,1)  (1,3,2)  (4,3)  (7,1)    (5,4)
                                 (2,1,3)  (5,2)  (1,2,5)  (7,2)
                                 (2,3,1)  (6,1)  (1,3,4)  (8,1)
                                 (3,1,2)         (1,4,3)  (1,3,5)
                                 (3,2,1)         (1,5,2)  (1,5,3)
                                                 (2,1,5)  (3,1,5)
                                                 (2,5,1)  (3,5,1)
                                                 (3,1,4)  (5,1,3)
                                                 (3,4,1)  (5,3,1)
                                                 (4,1,3)
                                                 (4,3,1)
                                                 (5,1,2)
                                                 (5,2,1)
		

Crossrefs

A007360 is the unordered version, with non-strict version A051424.
A101268 is the not necessarily strict version.
A220377*6 counts these compositions of length 3.
A337561 does not consider a singleton to be coprime unless it is (1), with non-strict version A337462.
A337664 looks only at distinct parts.
A000740 counts relatively prime compositions, with strict case A332004.
A072706 counts unimodal strict compositions.
A178472 counts compositions with a common factor.
A327516 counts pairwise coprime partitions, with strict case A305713.
A328673 counts pairwise non-coprime partitions.
A333228 ranks compositions whose distinct parts are pairwise coprime.

Programs

  • Mathematica
    Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],UnsameQ@@#&&(Length[#]<=1||CoprimeQ@@#)&]],{n,0,10}]

Formula

a(n > 1) = A337561(n) + 1 for n > 1.

A337601 Number of unordered triples of positive integers summing to n whose set of distinct parts is pairwise coprime, where a singleton is not considered coprime unless it is (1).

Original entry on oeis.org

0, 0, 0, 1, 1, 2, 2, 3, 4, 4, 5, 6, 8, 7, 10, 7, 11, 11, 17, 12, 19, 12, 19, 17, 29, 16, 28, 19, 31, 23, 46, 23, 42, 25, 45, 27, 59, 31, 57, 34, 61, 37, 84, 38, 75, 42, 74, 47, 107, 45, 98, 51, 96, 56, 135, 54, 115, 63, 117, 67, 174, 65, 139, 75, 144, 75, 194
Offset: 0

Views

Author

Gus Wiseman, Sep 20 2020

Keywords

Comments

First differs from A337600 at a(9) = 4, A337600(9) = 5.

Examples

			The a(3) = 1 through a(14) = 10 partitions (A = 10, B = 11, C = 12):
  111  211  221  321  322  332  441  433  443  543  544  554
            311  411  331  431  522  532  533  552  553  743
                      511  521  531  541  551  651  661  752
                           611  711  721  722  732  733  761
                                     811  731  741  751  833
                                          911  831  922  851
                                               921  B11  941
                                               A11       A31
                                                         B21
                                                         C11
		

Crossrefs

A014612 intersected with A304711 ranks these partitions.
A220377 is the strict case.
A304709 counts these partitions of any length.
A307719 is the strict case except for any number of 1's.
A337600 considers singletons to be coprime.
A337603 is the ordered version.
A000217 counts 3-part compositions.
A000837 counts relatively prime partitions.
A001399/A069905/A211540 count 3-part partitions.
A023023 counts relatively prime 3-part partitions.
A051424 counts pairwise coprime or singleton partitions.
A101268 counts pairwise coprime or singleton compositions.
A305713 counts pairwise coprime strict partitions.
A327516 counts pairwise coprime partitions.
A333227 ranks pairwise coprime compositions.
A333228 ranks compositions whose distinct parts are pairwise coprime.
A337461 counts pairwise coprime 3-part compositions.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n,{3}],CoprimeQ@@Union[#]&]],{n,0,100}]

Formula

For n > 0, a(n) = A337600(n) - A079978(n).
Previous Showing 11-20 of 46 results. Next