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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133489 a(1)=2. For n >= 2, a(n) = a(n-1) + 1 + (the largest prime among the first n-1 terms of the sequence {a(k)}). 0
2, 5, 11, 23, 47, 95, 143, 191, 383, 767, 1151, 2303, 3455, 4607, 5759, 6911, 13823, 20735, 27647, 55295, 82943, 110591, 138239, 276479, 414719, 552959, 691199, 1382399, 2073599, 2764799, 3455999, 6911999, 10367999, 13823999, 17279999 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

The largest prime among the first 7 terms of the sequence is a(5)=47. So a(8) = a(7) + 1 + 47 = 143 + 1 + 47 = 191.

MATHEMATICA

a = {2}; Do[AppendTo[a, a[[ -1]] + 1 + Select[a, PrimeQ[ # ] &][[ -1]]], {40}]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 03 2007

CROSSREFS

Sequence in context: A000100 A175867 A083005 * A060153 A086219 A055010

Adjacent sequences:  A133486 A133487 A133488 * A133490 A133491 A133492

KEYWORD

nonn

AUTHOR

Leroy Quet Nov 30 2007

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 03 2007

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 14 23:53 EST 2012. Contains 205689 sequences.