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.

A326155 Positive integers whose sum of prime indices is divisible by their product of prime indices.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 16, 17, 19, 23, 29, 30, 31, 32, 37, 40, 41, 43, 47, 48, 53, 59, 61, 64, 67, 71, 73, 79, 83, 84, 89, 97, 101, 103, 107, 108, 109, 112, 113, 127, 128, 131, 137, 139, 144, 149, 151, 157, 163, 167, 173, 179, 181, 191, 192, 193
Offset: 1

Views

Author

Gus Wiseman, Jun 10 2019

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.
Also Heinz numbers of the integer partitions counted by A057567. 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:
   1: {}
   2: {1}
   3: {2}
   4: {1,1}
   5: {3}
   7: {4}
   8: {1,1,1}
   9: {2,2}
  11: {5}
  12: {1,1,2}
  13: {6}
  16: {1,1,1,1}
  17: {7}
  19: {8}
  23: {9}
  29: {10}
  30: {1,2,3}
  31: {11}
  32: {1,1,1,1,1}
  37: {12}
		

Crossrefs

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[100],Divisible[Plus@@primeMS[#],Times@@primeMS[#]]&]