Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114599
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114599 a(1)=a(2)=1. For n >= 3, a(n) = 1 + (A114600(n-2))*(A114600(n-1)). +0
2
1, 1, 2, 3, 7, 22, 78, 144, 40, 16, 11, 23, 254, 2922, 61850, 602420, 409448, 42038, 2669414, 38065410, 255320214, 315752716934, 22408767609924, 18684193273697426172, 85136306795697966858, 4400725717987783759574480 (list; graph; listen)
OFFSET

1,3

EXAMPLE

13 is the greatest prime dividing a(7) = 78, and 3 is the greatest prime dividing a(8) = 144. So a(9) = 1 +

13*3 = 40.

MATHEMATICA

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

CROSSREFS

Cf. A006530, A114600.

Sequence in context: A067738 A053966 A010738 this_sequence A094062 A038159 A077210

Adjacent sequences: A114596 A114597 A114598 this_sequence A114600 A114601 A114602

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