Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114600
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114600 Highest prime divisor of A114599(n) (or 1 if A114599(n) is 1). +0
2
1, 1, 2, 3, 7, 11, 13, 3, 5, 2, 11, 23, 127, 487, 1237, 331, 127, 21019, 1811, 140983, 2239651, 10005473, 1867397300827, 45590891, 96526424938433069, 6424815538907849, 3320782322201303130883, 167483630406434494769 (list; graph; listen)
OFFSET

1,3

FORMULA

a(n) = A006530(A114599(n)).

MATHEMATICA

f[n_] := If[n == 1, 1, FactorInteger[n][[ -1, 1 ]]]; g[l_] := Append[l, 1 + Times @@ f /@ Take[l, -2]]; f/@Nest[g, {1, 1}, 30] (*Chandler*)

CROSSREFS

Cf. A006530, A114599.

Sequence in context: A064956 A110449 A067991 this_sequence A088905 A045319 A038613

Adjacent sequences: A114597 A114598 A114599 this_sequence A114601 A114602 A114603

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Dec 13 2005

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 26 2005

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 November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research