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”).

A320698
Numbers whose product of prime indices is a prime power (A246655).
6
3, 5, 6, 7, 9, 10, 11, 12, 14, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 31, 34, 36, 38, 40, 41, 42, 44, 46, 48, 49, 50, 53, 54, 56, 57, 59, 62, 63, 67, 68, 72, 76, 80, 81, 82, 83, 84, 88, 92, 96, 97, 98, 100, 103, 106, 108, 109, 112, 114, 115, 118, 121, 124
OFFSET
1,1
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 numbers whose prime indices are all powers of a common prime number.
EXAMPLE
The sequence of all integer partitions whose Heinz numbers belong to the sequence begins: (2), (3), (1,2), (4), (2,2), (1,3), (5), (1,1,2), (1,4), (7), (1,2,2), (8), (1,1,3), (2,4), (1,5), (9), (1,1,1,2), (3,3), (2,2,2), (1,1,4), (11), (1,7), (1,1,2,2), (1,8), (1,1,1,3), (13), (1,2,4), (1,1,5), (1,9), (1,1,1,1,2), (4,4), (1,3,3), (16), (1,2,2,2), (1,1,1,4), (2,8).
MATHEMATICA
Select[Range[100], PrimePowerQ[Times@@Cases[FactorInteger[#], {p_, k_}:>PrimePi[p]^k]]&]
PROG
(PARI) is(n) = my(f=factor(n)[, 1]~, p=1); for(k=1, #f, p=p*primepi(f[k])); isprimepower(p) \\ Felix Fröhlich, Oct 20 2018
KEYWORD
nonn
AUTHOR
Gus Wiseman, Oct 19 2018
STATUS
approved