login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A169606 a(2n-1) = prime(n+2)-3, a(2n) = prime(n+2)-2. 2
2, 3, 4, 5, 8, 9, 10, 11, 14, 15, 16, 17, 20, 21, 26, 27, 28, 29, 34, 35, 38, 39, 40, 41, 44, 45, 50, 51, 56, 57, 58, 59, 64, 65, 68, 69, 70, 71, 76, 77, 80, 81, 86, 87, 94, 95, 98, 99, 100, 101, 104, 105, 106, 107, 110, 111, 124, 125, 128, 129, 134, 135, 136, 137, 146 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000

FORMULA

a(n) ~ 0.5 n log n. - Charles R Greathouse IV, May 25 2011

EXAMPLE

a(1)=5-3=2; a(2)=5-2=3; a(3)=7-3=4.

MATHEMATICA

Table[If[OddQ[n], Prime[(n+1)/2+2]-3, Prime[n/2+2]-2], {n, 70}] (* Harvey P. Dale, Oct 25 2020 *)

PROG

(PARI) forprime(p=5, 97, print1(p-3", "p-2", ")) \\ Charles R Greathouse IV, May 25 2011

CROSSREFS

Cf. A047247, A000040.

Sequence in context: A068406 A276878 A047247 * A140769 A032877 A032844

Adjacent sequences:  A169603 A169604 A169605 * A169607 A169608 A169609

KEYWORD

nonn,easy

AUTHOR

Juri-Stepan Gerasimov, Dec 03 2009

EXTENSIONS

Entries checked by R. J. Mathar, Apr 14 2010

Definition reworded by N. J. A. Sloane, Aug 24 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 30 09:34 EST 2021. Contains 349419 sequences. (Running on oeis4.)