|
|
A034173
|
|
a(n) is minimal such that prime factorizations of a(n), ..., a(n)+n-1 have same exponents.
|
|
13
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Don Reble has shown that a(8) < 1.9*10^42, cf. link.
a(8) <= 108111092880293127811946663766147737122,
a(9) <= 6850672946809600696044301071559918192380244,
a(10) <= 96037988156124494415303285590850571857698741869620,
a(11) <= 9044737840075556371215937303485030235666252755947862558252154847122. (End)
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(4) = 19940 because 19940, ..., 19943 all have the form p^2 q r.
|
|
PROG
|
(PARI) A034173(n)={my(f); for(k=1, 9e9, f=0; for(i=1, n, f==(f=vecsort(factor(k+n-i)[, 2])) || i==1 || [k+=n-i; next(2)]); return(k))} \\ M. F. Hasler, Oct 23 2012
|
|
CROSSREFS
|
|
|
KEYWORD
|
hard,nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|