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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049613 a(n) = 2n - (largest prime < 2n-2). 6
3, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 5, 7, 3, 3, 5, 7, 3, 5, 3, 3, 5, 3, 5, 7, 3, 5, 7, 3, 3, 5, 7, 3, 5, 3, 3, 5, 7, 3, 5, 3, 5, 7, 3, 5, 7, 9, 3, 5, 3, 3, 5, 3, 3, 5, 3, 5, 7, 9, 11, 13, 15, 3, 5, 3, 5, 7, 3, 3, 5, 7, 9, 11, 3, 3, 5, 7, 3, 5, 7, 3, 5, 3, 5, 7, 3, 5, 7, 3, 3, 5 (list; graph; refs; listen; history; internal format)
OFFSET

3,1

LINKS

T. D. Noe, Table of n, a(n) for n=3..10000

FORMULA

a(n) <= A002373(n). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 19 2008

EXAMPLE

a(14)=28 - (largest prime < 26) = 28 - 23 = 5.

MATHEMATICA

Table[2n-NextPrime[2n-2, -1], {n, 3, 100}] (* From Harvey P. Dale, Aug 16 2011 *)

CROSSREFS

Cf. A049653, A049711, A049716, A049847.

Sequence in context: A123371 A011277 A084742 * A002373 A103153 A162022

Adjacent sequences:  A049610 A049611 A049612 * A049614 A049615 A049616

KEYWORD

nice,nonn,easy

AUTHOR

David M. Elder (elddm(AT)rhodes.edu)

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 15 06:52 EST 2012. Contains 205694 sequences.