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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A076273 a(0) = 1, a(1) = 2; for n>1, a(n) = prime(n)+prime(n-1)-1. 5
 1, 2, 4, 7, 11, 17, 23, 29, 35, 41, 51, 59, 67, 77, 83, 89, 99, 111, 119, 127, 137, 143, 151, 161, 171, 185, 197, 203, 209, 215, 221, 239, 257, 267, 275, 287, 299, 307, 319, 329, 339, 351, 359, 371, 383, 389, 395, 409, 433, 449, 455, 461, 471, 479, 491, 507, 519, 531 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Least m such that A076272(m) > A076272(m-1) for n>0; a(0)=1. A076272(a(k)+j) = A008578(k) for k>0 and 0<=j < A075527(k-1). LINKS Harvey P. Dale, Table of n, a(n) for n = 0..1000 FORMULA a(n) = A001043(n-1)-1, n>1. - R. J. Mathar, Jun 04 2020 MATHEMATICA nxt[{a_, b_}]:={a+1, Prime[a+1]+Prime[a]-1}; Join[{1}, Transpose[ NestList[ nxt, {1, 2}, 60]][[2]]] (* or *) Join[{1, 2}, Total/@Partition[Prime[ Range[ 60]], 2, 1]-1] (* Harvey P. Dale, Jun 12 2012 *) PROG (PARI) a(n)=if(n<2, 1, if(n==2, 2, prime(n-1)+prime(n-2)-1)) (Klasen) CROSSREFS Cf. A001043. Sequence in context: A192589 A266448 A101978 * A024455 A038045 A178063 Adjacent sequences:  A076270 A076271 A076272 * A076274 A076275 A076276 KEYWORD nonn,easy AUTHOR Reinhard Zumkeller, Oct 04 2002 EXTENSIONS Simpler description from Vladeta Jovovic, Mar 29 2003 More terms from Lambert Klasen (lambert.klasen(AT)gmx.de), Jan 14 2005 STATUS approved

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.

Last modified August 11 20:13 EDT 2022. Contains 356067 sequences. (Running on oeis4.)