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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A138961 a(n) = largest prime divisor of A138957(n). 6

%I #17 May 26 2022 09:53:13

%S 1,3,41,617,823,643,9721,14593,3803,14405693,10939223,4156374407,

%T 2663693,5603770631,1221751714624799,287108811653770498027,

%U 74103167823547,11843077531813991,726216405947772436185983423,769725127,18274551225153265813469

%N a(n) = largest prime divisor of A138957(n).

%C For smallest prime divisors see A138960.

%H Robert Price, <a href="/A138961/b138961.txt">Table of n, a(n) for n = 1..60</a>

%t a = {}; b = {}; Do[w = RealDigits[n]; w = First[w]; Do[AppendTo[a, w[[Length[w] - k + 1]]], {k, 1, Length[w]}]; p = FromDigits[a]; AppendTo[b, First[Last[FactorInteger[p]]]], {n, 1, 18}]; b

%t A137957[n_] := FromDigits[Flatten[Reverse /@ IntegerDigits[Range[n]]]];

%t Table[First[Last[FactorInteger[A137957[n]]]], {n, 39}] (* _Robert Price_, May 10 2019 *)

%Y Cf. A104759, A000422, A116504, A007908, A116505, A104759, A138789, A138790, A138960.

%K nonn,base

%O 1,2

%A _Artur Jasinski_, Apr 04 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 07:34 EDT 2024. Contains 372300 sequences. (Running on oeis4.)