Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138962
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138962 a(1)=1; a(n+1) = the smallest prime divisor of A138793(n+1). +0
6
1, 3, 3, 29, 3, 3, 19, 3, 3, 457, 3, 3, 16087, 3, 3, 35963, 3, 3, 167, 3, 3, 7, 3, 3, 13, 3, 3, 953, 3, 3, 7 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

b = {}; a = {}; Do[w = RealDigits[n]; w = First[w]; Do[AppendTo[a, w[[k]]], {k, 1, Length[w]}]; p = FromDigits[Reverse[a]]; AppendTo[b, First[First[FactorInteger[p]]]], {n, 1, 31}]; b (*Artur Jasinski*)

CROSSREFS

Cf. A104759, A000422, A116504, A007908, A116505, A104759, A075019, A075020, A075021, A075022, A138789, A138790, A138958, A138959, A138960, A138962.

Sequence in context: A080272 A098340 A075020 this_sequence A139206 A100651 A124244

Adjacent sequences: A138959 A138960 A138961 this_sequence A138963 A138964 A138965

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 September 5 01:44 EDT 2008. Contains 143476 sequences.


AT&T Labs Research