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.

A384396 Position of first appearance of n in A384389 (proper choices of disjoint strict partitions of each prime index).

Original entry on oeis.org

1, 5, 11, 13, 17, 19, 62, 23, 111, 29, 123, 31, 129, 217, 37, 141, 106, 41, 159, 391, 118, 43
Offset: 0

Views

Author

Gus Wiseman, Jun 03 2025

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
By "proper" we exclude the case of all singletons, which is disjoint when n is squarefree.

Crossrefs

Positions of first appearances in A384389.
A000041 counts integer partitions, strict A000009.
A048767 is the Look-and-Say transform, fixed points A048768, counted by A217605.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798.
A239455 counts Look-and-Say partitions, ranks A351294
A351293 counts non-Look-and-Say partitions, ranks A351295.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    pofprop[y_]:=Select[DeleteCases[Join@@@Tuples[IntegerPartitions/@y],y],UnsameQ@@#&];
    lv=Table[Length[pofprop[prix[n]]],{n,100}];
    mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
    Table[Position[lv,x][[1,1]],{x,0,mnrm[lv+1]-1}]