OFFSET
1,2
COMMENTS
Also for 1 < n < 10, a(n) is the common prime divisor for all A010785(m) which consist of n digits. - Alexander R. Povolotsky, Jun 05 2014, corrected by M. F. Hasler, Jul 30 2015
According to the definition (and given terms), this is the greatest prime factor (A006530) of A173426 and not of A002477, as an earlier formula asserted and which may have been an assumption of the preceding comment. - M. F. Hasler, Jul 29 2015
LINKS
M. F. Hasler, Table of n, a(n) for n = 1..36
FORMULA
EXAMPLE
MATHEMATICA
Table[FactorInteger[FromDigits[Join[Flatten[IntegerDigits/@Range[ n]], Flatten[ IntegerDigits/@Range[n-1, 1, -1]]]]][[-1, 1]], {n, 20}] (* Harvey P. Dale, May 20 2016 *)
PROG
(PARI) a(n) = {if (n == 1, return (1)); s = ""; for (i=1, n, s = concat(s, Str(i)); ); forstep (i=n-1, 1, -1, s = concat(s, Str(i)); ); f = factor(eval(s)); f[#f~, 1]; } \\ Michel Marcus, Jun 05 2014
(PARI) A075024(n)=A006530(A173426(n)) \\ A006530 should provide efficient code and also covers the case n=1. - M. F. Hasler, Jul 29 2015
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, Sep 01 2002
EXTENSIONS
More terms from Sascha Kurz, Jan 03 2003
a(16)-a(17) from Michel Marcus, Jun 05 2014
More terms from M. F. Hasler, Jul 29 2015
STATUS
approved