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.

A342339 Heinz numbers of the integer partitions counted by A342337, which have all adjacent parts (x, y) satisfying either x = y or x = 2y.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 16, 17, 18, 19, 21, 23, 24, 25, 27, 29, 31, 32, 36, 37, 41, 42, 43, 47, 48, 49, 53, 54, 59, 61, 63, 64, 65, 67, 71, 72, 73, 79, 81, 83, 84, 89, 96, 97, 101, 103, 107, 108, 109, 113, 121, 125, 126, 127, 128, 131, 133, 137
Offset: 1

Views

Author

Gus Wiseman, Mar 11 2021

Keywords

Comments

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), giving a bijective correspondence between positive integers and integer partitions.

Examples

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

Crossrefs

The first condition alone gives A000961 (perfect powers).
The second condition alone is counted by A154402.
These partitions are counted by A342337.
A018819 counts partitions into powers of 2.
A000929 counts partitions with adjacent parts x >= 2y.
A002843 counts compositions with adjacent parts x <= 2y.
A045690 counts sets with maximum n in with adjacent elements y < 2x.
A224957 counts compositions with x <= 2y and y <= 2x (strict: A342342).
A274199 counts compositions with adjacent parts x < 2y.
A342094 counts partitions with adjacent x <= 2y (strict: A342095).
A342096 counts partitions without adjacent x >= 2y (strict: A342097).
A342098 counts partitions with adjacent parts x > 2y.
A342330 counts compositions with x < 2y and y < 2x (strict: A342341).
A342331 counts compositions with adjacent parts x = 2y or y = 2x.
A342332 counts compositions with adjacent parts x > 2y or y > 2x.
A342333 counts compositions with adjacent parts x >= 2y or y >= 2x.
A342334 counts compositions with adjacent parts x >= 2y or y > 2x.
A342335 counts compositions with adjacent parts x >= 2y or y = 2x.
A342338 counts compositions with adjacent parts x < 2y and y <= 2x.
A342342 counts strict compositions with adjacent parts x <= 2y and y <= 2x.

Programs

  • Mathematica
    Select[Range[100],With[{y=PrimePi/@First/@FactorInteger[#]},And@@Table[y[[i]]==y[[i-1]]||y[[i]]==2*y[[i-1]],{i,2,Length[y]}]]&]