OFFSET
1,1
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..1000
FORMULA
EXAMPLE
. ----+----+-------+---------------------------------
. 1 | 2 | 2 | 8
. 2 | 3 | 4 | 27
. 3 | 5 | 8 | 125
. 4 | 7 | 13 | 343
. 5 | 11 | 23 | 1331
. 6 | 13 | 29 | 2197
. 7 | 17 | 39 | 4913
. 8 | 19 | 45 | 6859
. 9 | 23 | 57 | 12167
. 10 | 29 | 75 | 24389
. 11 | 31 | 81 | 29791
. 12 | 37 | 99 | 50653
. 13 | 41 | 110 | 68921
. 14 | 43 | 117 | 79507
. 15 | 47 | 130 | 103823
. 16 | 53 | 149 | 148877
. 17 | 59 | 169 | 205379
. 18 | 61 | 176 | 226981
. 19 | 67 | 197 | 300763
. 20 | 71 | 209 | 357911
. 21 | 73 | 212 | 389017
. 22 | 79 | 236 | 493039
. 23 | 83 | 250 | 571787
. 24 | 89 | 270 | 704969
. 25 | 97 | 295 | 912673 .
MATHEMATICA
With[{m = 60}, c = Select[Range[Prime[m]^3], Min[FactorInteger[#][[;; , 2]]] > 2 &]; 1 + Flatten[FirstPosition[c, #] & /@ (Prime[Range[m]]^3)]] (* Amiram Eldar, Feb 07 2023 *)
PROG
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a258600 = (+ 1) . fromJust . (`elemIndex` a258568_list) . a000040
(Python)
from math import gcd
from sympy import prime, integer_nthroot, factorint
def A258600(n):
c, m = 0, prime(n)**3
for w in range(1, integer_nthroot(m, 5)[0]+1):
if all(d<=1 for d in factorint(w).values()):
for y in range(1, integer_nthroot(z:=m//w**5, 4)[0]+1):
if gcd(w, y)==1 and all(d<=1 for d in factorint(y).values()):
c += integer_nthroot(z//y**4, 3)[0]
return c # Chai Wah Wu, Sep 10 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jun 06 2015
EXTENSIONS
a(11)-a(55) and example corrected by Amiram Eldar, Feb 07 2023
STATUS
approved