Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138960
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138960 a(n) = smallest prime divisor of A138957(n). +0
8
1, 2, 3, 2, 3, 2, 127, 2, 3, 857, 3, 3, 18503, 3, 3, 43, 3, 3, 17, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 7, 3, 3, 1051, 3, 3, 67103, 3 (list; graph; listen)
OFFSET

1,2

COMMENT

For largest prime divisors see A138961

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[First[FactorInteger[p]]]], {n, 1, 38}]; b (*Artur Jasinski*)

CROSSREFS

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

Sequence in context: A164962 A119880 A075019 this_sequence A115397 A075370 A030350

Adjacent sequences: A138957 A138958 A138959 this_sequence A138961 A138962 A138963

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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research