OFFSET
1,1
COMMENTS
All members of this sequence, by definition, only have primes and 1 as exponents of prime factors.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
EXAMPLE
24 is part of the sequence because its prime factorization is 2^3*3.
122472 is part of the sequence because its prime factorization is 2^3*3^7*7
10756480 is not part of the sequence because it prime factorization is 2^7*7^5*5. This does not follow the rule where each base in the chain must be greater than the previous (7<5 is not true).
PROG
(Python)
def prime_factors(n):
factors = {}
i = 2
while n != 1:
while n % i == 0:
n /= i
if i in factors:
factors[i] += 1
else:
factors[i] = 1
i += 1
return factors
def a(n):
i = 1
c = 0
while c < n:
i += 1
p = prime_factors(i)
if len(p) > 1 and list(p.keys())[1:]+[1] == list(p.values()):
c +=1
return i
(PARI) is(n)=my(f=factor(n)); if(#f~<2, return(0)); for(i=2, #f~, if(f[i, 1]!=f[i-1, 2], return(0))); f[#f~, 2]==1 \\ Charles R Greathouse IV, Oct 22 2017
(PARI) get(q, N)=my(v, pq); if(N>>q == 0, return(if(N<1, [], [1]))); v=List([1]); forprime(p=2, min(sqrtnint(N, q), q-1), pq=p^q; u=pq*get(p, N\pq); for(i=1, #u, listput(v, u[i])); u=0); Set(v)
list(lim)=my(v=List(), u, t); lim\=1; forprime(q=3, lambertw(log(2)*lim)\log(2), forprime(p=2, min(sqrtnint(lim, q), q-1), t=p^q*q; u=t*get(p, lim\t); for(i=1, #u, listput(v, u[i])); u=0)); Set(v) \\ Charles R Greathouse IV, Oct 22 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Matthew McCaskill, Oct 22 2017
EXTENSIONS
a(10)-a(30) from Charles R Greathouse IV, Oct 22 2017
Definition corrected by Jens Kruse Andersen, Oct 28 2017
STATUS
approved