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.

A376379 Heinz numbers of integer partitions (x_1, ..., x_k) with at least 2 parts, sorted by increasing multinomial coefficients (x_1 + ... + x_k)!/(x_1! * ... * x_k!). In case of ties, the partitions are sorted in standard order as in A080577.

Original entry on oeis.org

4, 6, 10, 14, 8, 9, 22, 26, 34, 38, 15, 46, 58, 12, 62, 74, 82, 21, 86, 94, 106, 118, 122, 20, 25, 134, 33, 142, 146, 158, 16, 166, 178, 194, 202, 39, 206, 214, 18, 28, 218, 226, 254, 262, 274, 35, 278, 51, 298, 302, 314, 326, 334, 346, 44, 358, 362, 382, 57
Offset: 1

Views

Author

Pontus von Brömssen, Sep 23 2024

Keywords

Comments

This is a permutation of the composite numbers A002808.

Examples

			  n | A376367(n) | partition | a(n)
  --+------------+-----------+-----
  1 |     2      |  (1,1)    |   4
  2 |     3      |  (2,1)    |   6
  3 |     4      |  (3,1)    |  10
  4 |     5      |  (4,1)    |  14
  5 |     6      |  (1,1,1)  |   8
  6 |     6      |  (2,2)    |   9
  7 |     6      |  (5,1)    |  22
The number 210 appears 6 times in A376367, corresponding to the partitions (4,1,1,1), (3,2,2), (6,4), (13,1,1), (19,2), and (209,1), with Heinz numbers 56, 45, 91, 164, 201 and 2578, respectively. These numbers appear as a(257), ..., a(262).
		

Crossrefs

Formula

A318762(a(n)) = A376367(n).