Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138961
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138961 a(n) = largest prime divisor of A138957(n). +0
6
1, 3, 41, 617, 823, 643, 9721, 14593, 3803, 14405693, 10939223, 4156374407, 2663693, 5603770631, 1221751714624799, 287108811653770498027, 74103167823547, 11843077531813991, 726216405947772436185983423, 769725127 (list; graph; listen)
OFFSET

1,2

COMMENT

For smallest prime divisors see A138960

MATHEMATICA

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 (*Artur Jasinski*)

CROSSREFS

Cf. A104759, A000422, A116504, A007908, A116505, A104759, A138789, A138790, A138958, A138960.

Sequence in context: A057650 A087544 A073844 this_sequence A075022 A012175 A007313

Adjacent sequences: A138958 A138959 A138960 this_sequence A138962 A138963 A138964

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Apr 04 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research