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.

A381540 Numbers appearing only once in A048767 (Look-and-Say partition of prime indices).

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 9, 11, 12, 13, 17, 18, 19, 20, 23, 24, 25, 28, 29, 31, 37, 40, 41, 43, 44, 45, 47, 48, 49, 50, 52, 53, 54, 56, 59, 61, 63, 67, 68, 71, 72, 73, 75, 76, 79, 80, 83, 88, 89, 92, 97, 98, 99, 101, 103, 104, 107, 108, 109, 112, 113, 116, 117, 121
Offset: 1

Views

Author

Gus Wiseman, Mar 02 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.
The Look-and-Say partition of a multiset or partition y is obtained by interchanging parts with multiplicities. For example, starting with (3,2,2,1,1) we get (2,2,2,1,1,1), the multiset union of ((1,1,1),(2,2),(2)).
The conjugate of a Look-and-Say partition is a section-sum partition; see A381431, union A381432, count A239455.

Examples

			The terms together with their prime indices begin:
   1: {}
   2: {1}
   3: {2}
   4: {1,1}
   5: {3}
   7: {4}
   9: {2,2}
  11: {5}
  12: {1,1,2}
  13: {6}
  17: {7}
  18: {1,2,2}
  19: {8}
  20: {1,1,3}
  23: {9}
  24: {1,1,1,2}
		

Crossrefs

- fixed points are A048768, A217605
- conjugate is A381431, fixed points A000961, A000005
- all numbers present are A351294, conjugate A381432
- numbers missing are A351295, conjugate A381433
- numbers appearing only once are A381540 (this), conjugate A381434
- numbers appearing more than once are A381541, conjugate A381435
A000040 lists the primes.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798.
A122111 represents conjugation in terms of Heinz numbers.
A239455 counts Look-and-Say partitions, complement A351293.
A381440 lists Look-and-Say partition of prime indices, conjugate A381436.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    hls[y_]:=Product[Prime[Count[y,x]]^x,{x,Union[y]}];
    Select[Range[100],Count[hls/@IntegerPartitions[Total[prix[#]]],#]==1&]