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!)
A014690 a(n) = n + prime(n+1). 6

%I #15 Mar 26 2024 14:38:11

%S 4,7,10,15,18,23,26,31,38,41,48,53,56,61,68,75,78,85,90,93,100,105,

%T 112,121,126,129,134,137,142,157,162,169,172,183,186,193,200,205,212,

%U 219,222,233,236,241,244,257,270,275,278,283,290,293,304,311,318,325,328

%N a(n) = n + prime(n+1).

%C In sequence of odd primes add 1 to first prime, add 2 to 2nd prime, add 3 to 3rd prime and so on.

%t a[n_]:=Prime[n+1]+n (_Zak Seidov_, May 05 2005)

%t With[{nn=60},Prime[Range[2,nn+1]]+Range[nn]] (* _Harvey P. Dale_, Oct 02 2015 *)

%Y Essentially the same sequence as A095116.

%K nonn,easy

%O 1,1

%A _Mohammad K. Azarian_

%E More terms from _Erich Friedman_.

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 25 13:38 EDT 2024. Contains 371970 sequences. (Running on oeis4.)