login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A325128
Numbers in whose prime factorization the exponent of prime(k) is less than k for all prime indices k.
11
1, 3, 5, 7, 11, 13, 15, 17, 19, 21, 23, 25, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 65, 67, 69, 71, 73, 75, 77, 79, 83, 85, 87, 89, 91, 93, 95, 97, 101, 103, 105, 107, 109, 111, 113, 115, 119, 121, 123, 127, 129, 131, 133, 137, 139, 141
OFFSET
1,2
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 Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so these are Heinz numbers of integer partitions where each part k appears fewer than k times. Such partitions are counted by A087153.
The asymptotic density of this sequence is Product_{k>=1} (1 - 1/prime(k)^k) = 0.44070243286030291209... - Amiram Eldar, Feb 02 2021
LINKS
EXAMPLE
The sequence of terms together with their prime indices begins:
1: {}
3: {2}
5: {3}
7: {4}
11: {5}
13: {6}
15: {2,3}
17: {7}
19: {8}
21: {2,4}
23: {9}
25: {3,3}
29: {10}
31: {11}
33: {2,5}
35: {3,4}
37: {12}
39: {2,6}
41: {13}
43: {14}
47: {15}
49: {4,4}
MATHEMATICA
Select[Range[100], And@@Cases[If[#==1, {}, FactorInteger[#]], {p_, k_}:>k<PrimePi[p]]&]
KEYWORD
nonn
AUTHOR
Gus Wiseman, Apr 01 2019
STATUS
approved