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-3 of 3 results.

A257541 The rank of the partition with Heinz number n.

Original entry on oeis.org

0, 1, -1, 2, 0, 3, -2, 0, 1, 4, -1, 5, 2, 1, -3, 6, -1, 7, 0, 2, 3, 8, -2, 1, 4, -1, 1, 9, 0, 10, -4, 3, 5, 2, -2, 11, 6, 4, -1, 12, 1, 13, 2, 0, 7, 14, -3, 2, 0, 5, 3, 15, -2, 3, 0, 6, 8, 16, -1, 17, 9, 1, -5, 4, 2, 18, 4, 7, 1, 19, -3, 20, 10, 0, 5
Offset: 2

Views

Author

Emeric Deutsch, May 09 2015

Keywords

Comments

The rank of a partition p is the largest part of p minus the number of parts of p.
The Heinz number of a partition p = [p_1, p_2, ..., p_r] is defined as Product(p_j-th prime, j=1...r) (concept used by Alois P. Heinz in A215366 as an "encoding" of a partition). For example, for the partition [1,1,1] the Heinz number is 2*2*2 = 8. Its rank is 1 - 3 = -2 = a(8). - Emeric Deutsch, Jun 09 2015
This is the Dyson rank (St000145), which is different from the Frobenius rank (St000183); see the FindStat links. - Gus Wiseman, Apr 13 2019

Examples

			a(24) = -2. Indeed, the partition corresponding to the Heinz number 24 = 2*2*2*3 is [1,1,1,2]; consequently, a(24)= 2 - 4 = -2.

References

  • G. E. Andrews, K. Eriksson, Integer Partitions, Cambridge Univ. Press, Cambridge, 2004.

Links

Crossrefs

Positions of 0's are A106529. Positions of 1's are A325233. Positions of -1's are A325234.
Cf. A000720, A001222, A061395, A215366.
Cf. A046660, A047993, A056239, A093641, A101198, A112798, A174090, A243055, A257990, A263297, A325134, A325178, A325225, A325235.

Programs

  • Maple
    with(numtheory): a := proc(n) options operator, arrow: pi(max(factorset(n)))-bigomega(n) end proc: seq(a(n), n = 2 .. 120);
  • Mathematica
    Table[PrimePi@ FactorInteger[n][[-1, 1]] - PrimeOmega@ n, {n, 2, 76}] (* Michael De Vlieger, May 09 2015 *)

Formula

a(n) = q(largest prime factor of n) - bigomega(n), where q(p) is defined by q-th prime = p while bigomega(n) is the number of prime factors of n, including multiplicities.

A325233 Heinz numbers of integer partitions with Dyson rank 1.

Original entry on oeis.org

3, 10, 15, 25, 28, 42, 63, 70, 88, 98, 105, 132, 147, 175, 198, 208, 220, 245, 297, 308, 312, 330, 343, 462, 468, 484, 495, 520, 544, 550, 693, 702, 726, 728, 770, 780, 816, 825, 1053, 1078, 1089, 1092, 1144, 1155, 1170, 1210, 1216, 1224, 1300, 1352, 1360
Offset: 1

Views

Author

Gus Wiseman, Apr 13 2019

Keywords

Comments

Numbers whose maximum prime index is one greater than their number of prime indices counted with multiplicity.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

Examples

			The sequence of terms together with their prime indices begins:
     3: {2}
    10: {1,3}
    15: {2,3}
    25: {3,3}
    28: {1,1,4}
    42: {1,2,4}
    63: {2,2,4}
    70: {1,3,4}
    88: {1,1,1,5}
    98: {1,4,4}
   105: {2,3,4}
   132: {1,1,2,5}
   147: {2,4,4}
   175: {3,3,4}
   198: {1,2,2,5}
   208: {1,1,1,1,6}
   220: {1,1,3,5}
   245: {3,4,4}
   297: {2,2,2,5}
   308: {1,1,4,5}

Links

Crossrefs

Positions of 1's in A257541.
Cf. A001222, A047993, A056239, A061395, A063995, A101198, A106529, A112798, A257990, A263297, A325225, A325234, A325235.

Programs

  • Mathematica
    Select[Range[1000],PrimePi[FactorInteger[#][[-1,1]]]-PrimeOmega[#]==1&]

A325235 Heinz numbers of integer partitions with Dyson rank 1 or -1.

Original entry on oeis.org

3, 4, 10, 12, 15, 18, 25, 27, 28, 40, 42, 60, 63, 70, 88, 90, 98, 100, 105, 112, 132, 135, 147, 150, 168, 175, 198, 208, 220, 225, 245, 250, 252, 280, 297, 308, 312, 330, 343, 352, 375, 378, 392, 420, 462, 468, 484, 495, 520, 528, 544, 550, 567, 588, 625, 630
Offset: 1

Views

Author

Gus Wiseman, Apr 13 2019

Keywords

Comments

Numbers whose maximum prime index and number of prime indices counted with multiplicity differ by 1.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

Examples

			The sequence of terms together with their prime indices begins:
    3: {2}
    4: {1,1}
   10: {1,3}
   12: {1,1,2}
   15: {2,3}
   18: {1,2,2}
   25: {3,3}
   27: {2,2,2}
   28: {1,1,4}
   40: {1,1,1,3}
   42: {1,2,4}
   60: {1,1,2,3}
   63: {2,2,4}
   70: {1,3,4}
   88: {1,1,1,5}
   90: {1,2,2,3}
   98: {1,4,4}
  100: {1,1,3,3}
  105: {2,3,4}
  112: {1,1,1,1,4}

Links

Crossrefs

Positions of 1's and -1's in A257541.
Cf. A001222, A047993, A056239, A061395, A063995, A101198, A106529, A112798, A257990, A263297, A325225, A325233, A325234.

Programs

  • Mathematica
    Select[Range[1000],Abs[PrimePi[FactorInteger[#][[-1,1]]]-PrimeOmega[#]]==1&]
Showing 1-3 of 3 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.