login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #16 Oct 25 2020 16:16:29

%S 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,

%T 45,50,51,56,57,58,59,64,65,68,69,70,71,76,77,80,81,86,87,94,95,98,99,

%U 100,101,104,105,106,107,110,111,124,125,128,129,134,135,136,137,146

%N a(2n-1) = prime(n+2)-3, a(2n) = prime(n+2)-2.

%H Harvey P. Dale, <a href="/A169606/b169606.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) ~ 0.5 n log n. - _Charles R Greathouse IV_, May 25 2011

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

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

%o (PARI) forprime(p=5,97,print1(p-3", "p-2", ")) \\ _Charles R Greathouse IV_, May 25 2011

%Y Cf. A047247, A000040.

%K nonn,easy

%O 1,1

%A _Juri-Stepan Gerasimov_, Dec 03 2009

%E Entries checked by _R. J. Mathar_, Apr 14 2010

%E Definition reworded by _N. J. A. Sloane_, Aug 24 2012

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)