login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A123581 a(1) = 3, a(n) = a(n-1) + greatest prime factor of a(n-1). 0
3, 6, 9, 12, 15, 20, 25, 30, 35, 42, 49, 56, 63, 70, 77, 88, 99, 110, 121, 132, 143, 156, 169, 182, 195, 208, 221, 238, 255, 272, 289, 306, 323, 342, 361, 380, 399, 418, 437, 460, 483, 506, 529, 552, 575, 598, 621, 644, 667, 696, 725, 754, 783, 812, 841, 870 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

a(16) = 88 because a(15) is 77 whose largest prime factor is 11 so 77 + 11 = 88

MATHEMATICA

a[1] = 3; a[n_] := a[n] = a[n - 1] + FactorInteger[a[n - 1]][[ -1, 1]]; Array[a, 56] (* Robert G. Wilson v *)

PROG

(PARI) {print1(a=3, ", "); for(n=2, 57, print1(a=a+vecmax(factor(a)[, 1]), ", "))} - Klaus Brockhaus, Nov 19 2006

CROSSREFS

Essentially the same as A036441 and A076271.

Sequence in context: A156242 A060293 A194273 * A187337 A184999 A189783

Adjacent sequences:  A123578 A123579 A123580 * A123582 A123583 A123584

KEYWORD

nonn,easy

AUTHOR

Ben Thurston (benthurston27(AT)yahoo.com), Nov 12 2006

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(at)rgwv.com) and Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 18 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.