A075021 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A075021

a(1) = 1; for n>1, a(n) = the largest prime divisor of the number C(n) formed from the concatenation of n, n-1, n-2, n-3, ... down to 1.

1, 7, 107, 149, 953, 218107, 402859, 4877, 379721, 54421, 370329218107, 5767189888301, 237927839, 1728836281, 136133374970881, 1190788477118549, 677181889, 399048049, 40617114482123, 629639170774346584751, 2605975408790409767, 65372140114441

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Daniel Suteu, Table of n, a(n) for n = 1..106

FORMULA

a(n) = A006530(A000422(n)). - Daniel Suteu, May 26 2022

EXAMPLE

a(4)= 149 as 149 is the largest prime divisor of 4321 =29*149

MATHEMATICA

b = {}; a = {}; Do[w = RealDigits[n]; w = First[w]; Do[AppendTo[a, w[[Length[w] - k + 1]]], {k, 1, Length[w]}]; p = FromDigits[Reverse[a]]; AppendTo[b, First[Last[FactorInteger[p]]]], {n, 1, 21}]; b (* Artur Jasinski, Apr 04 2008 *)

Table[FactorInteger[FromDigits[Flatten[IntegerDigits/@Range[n, 1, -1]]]] [[-1, 1]], {n, 20}] (* Harvey P. Dale, Dec 14 2020 *)

PROG

(PARI) a(n) = if(n==1, 1, vecmax(factor(eval(concat(apply(k->Str(n-k+1), [1..n]))))[, 1])); \\ Daniel Suteu, May 26 2022

CROSSREFS

Cf. A006530, A000422, A075019, A075020, A075022.

Cf. A104759, A116504, A007908, A116505, A104759, A138789, A138790, A138957, A138960, A138961, A138962.

Sequence in context: A213863 A231899 A188407 * A138963 A141932 A002687

Adjacent sequences: A075018 A075019 A075020 * A075022 A075023 A075024

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Sep 01 2002

EXTENSIONS

More terms from Sascha Kurz, Jan 03 2003

Name edited by Felix Fröhlich, May 26 2022

STATUS

approved