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

A302497
Powers of primes of squarefree index.
1
1, 2, 3, 4, 5, 8, 9, 11, 13, 16, 17, 25, 27, 29, 31, 32, 41, 43, 47, 59, 64, 67, 73, 79, 81, 83, 101, 109, 113, 121, 125, 127, 128, 137, 139, 149, 157, 163, 167, 169, 179, 181, 191, 199, 211, 233, 241, 243, 256, 257, 269, 271, 277, 283, 289, 293, 313, 317, 331
OFFSET
1,2
COMMENTS
A prime index of n is a number m such that prime(m) divides n.
EXAMPLE
49 is not in the sequence because 49 = prime(4)^2 but 4 is not squarefree.
Entry A302242 describes a correspondence between positive integers and multiset multisystems. In this case it gives the following sequence of constant set multisystems.
01: {}
02: {{}}
03: {{1}}
04: {{},{}}
05: {{2}}
08: {{},{},{}}
09: {{1},{1}}
11: {{3}}
13: {{1,2}}
16: {{},{},{},{}}
17: {{4}}
25: {{2},{2}}
27: {{1},{1},{1}}
29: {{1,3}}
31: {{5}}
32: {{},{},{},{},{}}
41: {{6}}
43: {{1,4}}
47: {{2,3}}
59: {{7}}
64: {{},{},{},{},{},{}}
MATHEMATICA
Select[Range[100], Or[#===1, PrimePowerQ[#]&&And@@SquareFreeQ/@PrimePi/@FactorInteger[#][[All, 1]]]&]
PROG
(PARI) is(n) = if(n==1, return(1), my(x=isprimepower(n)); if(x > 0, if(issquarefree(primepi(ceil(n^(1/x)))), return(1)))); 0 \\ Felix Fröhlich, Apr 10 2018
KEYWORD
nonn
AUTHOR
Gus Wiseman, Apr 09 2018
STATUS
approved