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.

Showing 1-10 of 11 results. Next

A381432 Heinz numbers of section-sum partitions. Union of A381431.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 20, 22, 23, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 64, 65, 67, 68, 69, 71, 73, 74, 75, 76, 77, 79, 80, 81, 82, 83
Offset: 1

Views

Author

Gus Wiseman, Feb 27 2025

Keywords

Comments

First differs from A320340, A364347, A350838 in containing 65.
The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.
The section-sum partition (A381436) of a multiset or partition y is defined as follows: (1) determine and remember the sum of all distinct parts, (2) remove one instance of each distinct part, (3) repeat until no parts are left. The remembered values comprise the section-sum partition. For example, starting with (3,2,2,1,1) we get (6,3).
Equivalently, the k-th part of the section-sum partition is the sum of all (distinct) parts that appear at least k times. Compare to the definition of the conjugate of a partition, where we count parts >= k.
The conjugate of a section-sum partition is a Look-and-Say partition; see A048767, union A351294, count A239455.

Examples

			The terms together with their prime indices begin:
    1: {}
    2: {1}
    3: {2}
    4: {1,1}
    5: {3}
    7: {4}
    8: {1,1,1}
    9: {2,2}
   10: {1,3}
   11: {5}
   13: {6}
   14: {1,4}
   15: {2,3}
   16: {1,1,1,1}
   17: {7}
   19: {8}
   20: {1,1,3}
   22: {1,5}
   23: {9}
   25: {3,3}
   26: {1,6}
   27: {2,2,2}
		

Crossrefs

Partitions of this type are counted by A239455, complement A351293.
The conjugate is A351294, union of A048767 (parts A381440, fixed A048768, A217605).
Union of A381431 (parts A381436).
The complement is A381433, conjugate A351295.
A000040 lists the primes, differences A001223.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A122111 represents conjugation in terms of Heinz numbers.
Set multipartitions: A050320, A089259, A116540, A270995, A296119, A318360, A318361.
Partition ideals: A300383, A317141, A381078, A381441, A381452, A381454.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    egs[y_]:=If[y=={},{},Table[Total[Select[Union[y],Count[y,#]>=i&]],{i,Max@@Length/@Split[y]}]];
    Select[Range[100],MemberQ[Times@@Prime/@#&/@egs/@IntegerPartitions[Total[prix[#]]],#]&]

A381431 Heinz number of the section-sum partition of the prime indices of n.

Original entry on oeis.org

1, 2, 3, 4, 5, 5, 7, 8, 9, 7, 11, 10, 13, 11, 11, 16, 17, 15, 19, 14, 13, 13, 23, 20, 25, 17, 27, 22, 29, 13, 31, 32, 17, 19, 17, 25, 37, 23, 19, 28, 41, 17, 43, 26, 33, 29, 47, 40, 49, 35, 23, 34, 53, 45, 19, 44, 29, 31, 59, 26, 61, 37, 39, 64, 23, 19, 67, 38
Offset: 1

Views

Author

Gus Wiseman, Feb 26 2025

Keywords

Comments

The image first differs from A320340, A364347, A350838 in containing a(150) = 65.
The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.
The section-sum partition (A381436) of a multiset or partition y is defined as follows: (1) determine and remember the sum of all distinct parts, (2) remove one instance of each distinct part, (3) repeat until no parts are left. The remembered values comprise the section-sum partition. For example, starting with (3,2,2,1,1) we get (6,3).
Equivalently, the k-th part of the section-sum partition is the sum of all (distinct) parts that appear at least k times. Compare to the definition of the conjugate of a partition, where we count parts >= k.
The conjugate of a section-sum partition is a Look-and-Say partition; see A048767, union A351294, count A239455.

Examples

			Prime indices of 180 are (3,2,2,1,1), with section-sum partition (6,3), so a(180) = 65.
The terms together with their prime indices begin:
   1: {}
   2: {1}
   3: {2}
   4: {1,1}
   5: {3}
   5: {3}
   7: {4}
   8: {1,1,1}
   9: {2,2}
   7: {4}
  11: {5}
  10: {1,3}
  13: {6}
  11: {5}
  11: {5}
  16: {1,1,1,1}
		

Crossrefs

The conjugate is A048767, union A351294, complement A351295, fix A048768 (count A217605).
Taking length instead of sum in the definition gives A238745, conjugate A181819.
Partitions of this type are counted by A239455, complement A351293.
The union is A381432, complement A381433.
Values appearing only once are A381434, more than once A381435.
These are the Heinz numbers of rows of A381436, conjugate A381440.
Greatest prime index of each term is A381437, counted by A381438.
A000040 lists the primes, differences A001223.
A003963 gives product of prime indices.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A122111 represents conjugation in terms of Heinz numbers.
Set multipartitions: A050320, A089259, A116540, A270995, A296119, A318360, A318361.
Partition ideals: A300383, A317141, A381078, A381441, A381452, A381454.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    egs[y_]:=If[y=={},{},Table[Total[Select[Union[y],Count[y,#]>=i&]],{i,Max@@Length/@Split[y]}]];
    Table[Times@@Prime/@egs[prix[n]],{n,100}]

Formula

A122111(a(n)) = A048767(n).

A350842 Number of integer partitions of n with no difference -2.

Original entry on oeis.org

1, 1, 2, 3, 4, 6, 9, 12, 16, 24, 30, 40, 54, 69, 89, 118, 146, 187, 239, 297, 372, 468, 575, 711, 880, 1075, 1314, 1610, 1947, 2359, 2864, 3438, 4135, 4973, 5936, 7090, 8466, 10044, 11922, 14144, 16698, 19704, 23249, 27306, 32071, 37639, 44019, 51457, 60113
Offset: 0

Views

Author

Gus Wiseman, Jan 20 2022

Keywords

Examples

			The a(1) = 1 through a(7) = 12 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)
       (11)  (21)   (22)    (32)     (33)      (43)
             (111)  (211)   (41)     (51)      (52)
                    (1111)  (221)    (222)     (61)
                            (2111)   (321)     (322)
                            (11111)  (411)     (511)
                                     (2211)    (2221)
                                     (21111)   (3211)
                                     (111111)  (4111)
                                               (22111)
                                               (211111)
                                               (1111111)
		

Crossrefs

Heinz number rankings are in parentheses below.
The version for no difference 0 is A000009.
The version for subsets of prescribed maximum is A005314.
The version for all differences < -2 is A025157, non-strict A116932.
The version for all differences > -2 is A034296, strict A001227.
The opposite version is A072670.
The version for no difference -1 is A116931 (A319630), strict A003114.
The multiplicative version is A350837 (A350838), strict A350840.
The strict case is A350844.
The complement for quotients is counted by A350846 (A350845).
A000041 = integer partitions.
A027187 = partitions of even length.
A027193 = partitions of odd length (A026424).
A323092 = double-free partitions (A320340), strict A120641.
A325534 = separable partitions (A335433).
A325535 = inseparable partitions (A335448).
A350839 = partitions with a gap and conjugate gap (A350841).

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],FreeQ[Differences[#],-2]&]],{n,0,30}]

A350839 Number of integer partitions of n with a difference < -1 and a conjugate difference < -1.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 2, 3, 7, 11, 17, 26, 39, 54, 81, 108, 148, 201, 269, 353, 467, 601, 779, 995, 1272, 1605, 2029, 2538, 3171, 3941, 4881, 6012, 7405, 9058, 11077, 13478, 16373, 19817, 23953, 28850, 34692, 41599, 49802, 59461, 70905, 84321, 100155, 118694
Offset: 0

Views

Author

Gus Wiseman, Jan 24 2022

Keywords

Comments

We define a difference of a partition to be a difference of two adjacent parts.

Examples

			The a(5) = 1 through a(10) = 17 partitions:
  (311)  (411)   (511)    (422)     (522)      (622)
         (3111)  (4111)   (611)     (711)      (811)
                 (31111)  (3311)    (4221)     (4222)
                          (4211)    (4311)     (4411)
                          (5111)    (5211)     (5221)
                          (41111)   (6111)     (5311)
                          (311111)  (33111)    (6211)
                                    (42111)    (7111)
                                    (51111)    (42211)
                                    (411111)   (43111)
                                    (3111111)  (52111)
                                               (61111)
                                               (331111)
                                               (421111)
                                               (511111)
                                               (4111111)
                                               (31111111)
		

Crossrefs

Allowing -1 gives A144300 = non-constant partitions.
Taking one of the two conditions gives A239955, ranked by A073492, A065201.
These partitions are ranked by A350841.
A000041 = integer partitions, strict A000009.
A034296 = flat (contiguous) partitions, strict A001227.
A073491 = numbers whose prime indices have no gaps, strict A137793.
A090858 = partitions with a single hole, ranked by A325284.
A116931 = partitions with differences != -1, strict A003114.
A116932 = partitions with differences != -1 or -2, strict A025157.
A277103 = partitions with the same number of odd parts as their conjugate.
A350837 = partitions with no adjacent doublings, strict A350840.
A350842 = partitions with differences != -2, strict A350844, sets A005314.

Programs

  • Mathematica
    conj[y_]:=If[Length[y]==0,y,Table[Length[Select[y,#>=k&]],{k,1,Max[y]}]];
    Table[Length[Select[IntegerPartitions[n],(Min@@Differences[#]<-1)&&(Min@@Differences[conj[#]]<-1)&]],{n,0,30}]

A350844 Number of strict integer partitions of n with no difference -2.

Original entry on oeis.org

1, 1, 1, 2, 1, 3, 3, 4, 4, 7, 7, 8, 11, 12, 15, 18, 21, 23, 31, 32, 40, 45, 54, 59, 73, 78, 94, 106, 122, 136, 161, 177, 203, 231, 259, 293, 334, 372, 417, 476, 525, 592, 663, 742, 821, 931, 1020, 1147, 1271, 1416, 1558, 1752, 1916, 2137, 2357, 2613, 2867
Offset: 0

Views

Author

Gus Wiseman, Jan 21 2022

Keywords

Examples

			The a(1) = 1 through a(12) = 11 partitions (A..C = 10..12):
  1   2   3    4   5    6     7    8     9     A      B     C
          21       32   51    43   62    54    73     65    84
                   41   321   52   71    63    82     74    93
                              61   521   72    91     83    A2
                                         81    541    92    B1
                                         432   721    A1    543
                                         621   4321   632   651
                                                      821   732
                                                            741
                                                            921
                                                            6321
		

Crossrefs

The version for no difference 0 is A000009.
The version for no difference > -2 is A001227, non-strict A034296.
The version for no difference -1 is A003114 (A325160).
The version for subsets of prescribed maximum is A005314.
The version for all differences < -2 is A025157, non-strict A116932.
The opposite version is A072670.
The multiplicative version is A350840, non-strict A350837 (A350838).
The non-strict version is A350842.
A000041 counts integer partitions.
A027187 counts partitions of even length.
A027193 counts partitions of odd length (A026424).
A116931 counts partitions with no difference -1 (A319630).
A323092 counts double-free integer partitions (A320340) strict A120641.
A325534 counts separable partitions (A335433).
A325535 counts inseparable partitions (A335448).

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],FreeQ[Differences[#],0|-2]&]],{n,0,30}]

A350841 Heinz numbers of integer partitions with a difference < -1 and a conjugate difference < -1.

Original entry on oeis.org

20, 28, 40, 44, 52, 56, 63, 68, 76, 80, 84, 88, 92, 99, 100, 104, 112, 116, 117, 124, 126, 132, 136, 140, 148, 152, 153, 156, 160, 164, 168, 171, 172, 176, 184, 188, 189, 196, 198, 200, 204, 207, 208, 212, 220, 224, 228, 232, 234, 236, 244, 248, 252, 260, 261
Offset: 1

Views

Author

Gus Wiseman, Jan 26 2022

Keywords

Comments

We define a difference of a partition to be a difference of two adjacent parts.

Examples

			The terms together with their prime indices begin:
   20: (3,1,1)
   28: (4,1,1)
   40: (3,1,1,1)
   44: (5,1,1)
   52: (6,1,1)
   56: (4,1,1,1)
   63: (4,2,2)
   68: (7,1,1)
   76: (8,1,1)
   80: (3,1,1,1,1)
   84: (4,2,1,1)
   88: (5,1,1,1)
   92: (9,1,1)
   99: (5,2,2)
		

Crossrefs

Heinz number rankings are in parentheses below.
Taking just one condition gives (A073492) and (A065201), counted by A239955.
These partitions are counted by A350839.
A000041 = integer partitions, strict A000009.
A034296 = partitions with no gaps (A073491), strict A001227 (A073485).
A090858 = partitions with a single gap of size 1 (A325284).
A116931 = partitions with no successions (A319630), strict A003114.
A116932 = partitions with no successions or gaps of size 1, strict A025157.
A350842 = partitions with no gaps of size 1, strict A350844, sets A005314.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    conj[y_]:=If[Length[y]==0,y,Table[Length[Select[y,#>=k&]],{k,1,Max[y]}]];
    Select[Range[100],(Min@@Differences[Reverse[primeMS[#]]]<-1)&&(Min@@Differences[conj[primeMS[#]]]<-1)&]

A350837 Number of integer partitions of n with no adjacent parts of quotient 2.

Original entry on oeis.org

1, 1, 2, 2, 4, 5, 7, 10, 14, 18, 24, 31, 41, 53, 70, 87, 112, 140, 178, 221, 277, 344, 428, 526, 648, 792, 971, 1180, 1436, 1738, 2103, 2533, 3049, 3660, 4387, 5242, 6259, 7450, 8860, 10511, 12453, 14723, 17387, 20489, 24121, 28343, 33269, 38982, 45632, 53327
Offset: 0

Views

Author

Gus Wiseman, Jan 18 2022

Keywords

Comments

The first of these partitions that is not double-free (see A323092 for definition) is (4,3,2).

Examples

			The a(1) = 1 through a(7) = 10 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)
       (11)  (111)  (22)    (32)     (33)      (43)
                    (31)    (41)     (51)      (52)
                    (1111)  (311)    (222)     (61)
                            (11111)  (411)     (322)
                                     (3111)    (331)
                                     (111111)  (511)
                                               (4111)
                                               (31111)
                                               (1111111)
		

Crossrefs

The version with quotients >= 2 is A000929, sets A018819.
<= 2 is A342094, ranked by A342191.
< 2 is A342096, sets A045690, strict A342097.
> 2 is A342098, sets A040039.
The sets version (subsets of prescribed maximum) is A045691.
These partitions are ranked by A350838.
The strict case is A350840.
A version for differences is A350842, strict A350844.
The complement is counted by A350846, ranked by A350845.
A000041 = integer partitions.
A116931 = partitions with no successions, ranked by A319630.
A116932 = partitions with differences != 1 or 2, strict A025157.
A323092 = double-free partitions, ranked by A320340.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], FreeQ[Divide@@@Partition[#,2,1],2]&]],{n,0,15}]

A350840 Number of strict integer partitions of n with no adjacent parts of quotient 2.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 2, 4, 5, 6, 7, 8, 10, 13, 17, 19, 22, 25, 30, 35, 43, 52, 60, 70, 81, 93, 106, 122, 142, 166, 190, 216, 249, 287, 325, 371, 420, 479, 543, 617, 695, 784, 888, 1000, 1126, 1266, 1420, 1594, 1792, 2008, 2247, 2514, 2809, 3135, 3496, 3891, 4332
Offset: 0

Views

Author

Gus Wiseman, Jan 20 2022

Keywords

Examples

			The a(1) = 1 through a(13) = 13 partitions (A..D = 10..13):
  1   2   3   4    5    6    7    8     9     A     B     C     D
              31   32   51   43   53    54    64    65    75    76
                   41        52   62    72    73    74    93    85
                             61   71    81    82    83    A2    94
                                  431   432   91    92    B1    A3
                                        531   532   A1    543   B2
                                              541   641   651   C1
                                                    731   732   643
                                                          741   652
                                                          831   751
                                                                832
                                                                931
                                                                5431
		

Crossrefs

The version for subsets of prescribed maximum is A045691.
The double-free case is A120641.
The non-strict case is A350837, ranked by A350838.
An additive version (differences) is A350844, non-strict A350842.
The non-strict complement is counted by A350846, ranked by A350845.
Versions for prescribed quotients:
= 2: A154402, sets A001511.
!= 2: A350840 (this sequence), sets A045691.
>= 2: A000929, sets A018819.
<= 2: A342095, non-strict A342094.
< 2: A342097, non-strict A342096, sets A045690.
> 2: A342098, sets A040039.
A000041 = integer partitions.
A000045 = sets containing n with all differences > 2.
A003114 = strict partitions with no successions, ranked by A325160.
A116931 = partitions with no successions, ranked by A319630.
A116932 = partitions with differences != 1 or 2, strict A025157.
A323092 = double-free integer partitions, ranked by A320340.
A350839 = partitions with gaps and conjugate gaps, ranked by A350841.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&And@@Table[#[[i-1]]/#[[i]]!=2,{i,2,Length[#]}]&]],{n,0,30}]

A045691 Number of binary words of length n with autocorrelation function 2^(n-1)+1.

Original entry on oeis.org

0, 1, 1, 3, 5, 11, 19, 41, 77, 159, 307, 625, 1231, 2481, 4921, 9883, 19689, 39455, 78751, 157661, 315015, 630337, 1260049, 2520723, 5040215, 10081661, 20160841, 40324163, 80643405, 161291731, 322573579, 645157041, 1290294393, 2580608475, 5161177495
Offset: 0

Views

Author

Torsten Sillke (torsten.sillke(AT)lhsystems.com)

Keywords

Comments

From Gus Wiseman, Jan 22 2022: (Start)
Also the number of subsets of {1..n} containing n but without adjacent elements of quotient 1/2. The Heinz numbers of these sets are a subset of the squarefree terms of A320340. For example, the a(1) = 1 through a(6) = 19 subsets are:
{1} {2} {3} {4} {5} {6}
{1,3} {1,4} {1,5} {1,6}
{2,3} {3,4} {2,5} {2,6}
{1,3,4} {3,5} {4,6}
{2,3,4} {4,5} {5,6}
{1,3,5} {1,4,6}
{1,4,5} {1,5,6}
{2,3,5} {2,5,6}
{3,4,5} {3,4,6}
{1,3,4,5} {3,5,6}
{2,3,4,5} {4,5,6}
{1,3,4,6}
{1,3,5,6}
{1,4,5,6}
{2,3,4,6}
{2,3,5,6}
{3,4,5,6}
{1,3,4,5,6}
{2,3,4,5,6}
(End)

Crossrefs

If a(n) counts subsets of {1..n} with n and without adjacent quotients 1/2:
- The version with quotients <= 1/2 is A018819, partitions A000929.
- The version with quotients < 1/2 is A040039, partitions A342098.
- The version with quotients >= 1/2 is A045690(n+1), partitions A342094.
- The version with quotients > 1/2 is A045690, partitions A342096.
- Partitions of this type are counted by A350837, ranked by A350838.
- Strict partitions of this type are counted by A350840.
- For differences instead of quotients we have A350842, strict A350844.
- Partitions not of this type are counted by A350846, ranked by A350845.
A000740 = relatively prime subsets of {1..n} containing n.
A002843 = compositions with all adjacent quotients >= 1/2.
A050291 = double-free subsets of {1..n}.
A154402 = partitions with all adjacent quotients 2.
A308546 = double-closed subsets of {1..n}, with maximum: shifted right.
A323092 = double-free integer partitions, ranked by A320340, strict A120641.
A326115 = maximal double-free subsets of {1..n}.

Programs

  • Mathematica
    Table[Length[Select[Subsets[Range[n]],MemberQ[#,n]&&And@@Table[#[[i-1]]/#[[i]]!=1/2,{i,2,Length[#]}]&]],{n,0,15}] (* Gus Wiseman, Jan 22 2022 *)

Formula

a(2*n-1) = 2*a(2*n-2) - a(n) for n >= 2; a(2*n) = 2*a(2*n-1) + a(n) for n >= 2.

Extensions

More terms from Sean A. Irvine, Mar 18 2021

A350845 Heinz numbers of integer partitions with at least two adjacent parts of quotient 2.

Original entry on oeis.org

6, 12, 18, 21, 24, 30, 36, 42, 48, 54, 60, 63, 65, 66, 72, 78, 84, 90, 96, 102, 108, 114, 120, 126, 130, 132, 133, 138, 144, 147, 150, 156, 162, 168, 174, 180, 186, 189, 192, 195, 198, 204, 210, 216, 222, 228, 231, 234, 240, 246, 252, 258, 260, 264, 266, 270
Offset: 1

Views

Author

Gus Wiseman, Jan 20 2022

Keywords

Comments

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so these are numbers with at least two adjacent prime indices of quotient 1/2.

Examples

			The terms and corresponding partitions begin:
   6: (2,1)
  12: (2,1,1)
  18: (2,2,1)
  21: (4,2)
  24: (2,1,1,1)
  30: (3,2,1)
  36: (2,2,1,1)
  42: (4,2,1)
  48: (2,1,1,1,1)
  54: (2,2,2,1)
  60: (3,2,1,1)
  63: (4,2,2)
  65: (6,3)
  66: (5,2,1)
  72: (2,2,1,1,1)
  78: (6,2,1)
  84: (4,2,1,1)
  90: (3,2,2,1)
  96: (2,1,1,1,1,1)
		

Crossrefs

The complement is A350838, counted by A350837.
The strict complement is counted by A350840.
These partitions are counted by A350846.
A000041 = integer partitions.
A000045 = sets containing n with all differences > 2.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A116931 = partitions with no successions, ranked by A319630.
A116932 = partitions with differences != 1 or 2, strict A025157.
A323092 = double-free integer partitions, ranked by A320340.
A325160 ranks strict partitions with no successions, counted by A003114.
A350839 = partitions with gaps and conjugate gaps, ranked by A350841.

Programs

  • Mathematica
    primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
    Select[Range[100],MemberQ[Divide@@@Partition[primeptn[#],2,1],2]&]
Showing 1-10 of 11 results. Next