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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A073136 a(n) = prime(n) + prime(prime(n)). 3
 5, 8, 16, 24, 42, 54, 76, 86, 106, 138, 158, 194, 220, 234, 258, 294, 336, 344, 398, 424, 440, 480, 514, 550, 606, 648, 666, 694, 708, 730, 836, 870, 910, 936, 1008, 1028, 1076, 1130, 1158, 1204, 1242, 1268, 1344, 1364, 1398, 1416, 1508, 1632, 1660, 1676, 1704 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Michael S. Branicky, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Harvey P. Dale) EXAMPLE For n = 5, prime(5) = 11 and prime(11) = 31, so a(5) = 11 + 31 = 42. MATHEMATICA pp[n_]:=Module[{p1=Prime[n]}, p1+Prime[p1]]; Array[pp, 50] (* Harvey P. Dale, Feb 19 2014 *) a[n_] := Prime[n] + Prime[Prime[n]]; Table[a[n], {n, 50}] (* Carlos Eduardo Olivieri, Dec 18 2014 *) PROG (PARI) a(n) = prime(n) + prime(prime(n)) \\ Michel Marcus, Jun 26 2013 (Python) from sympy import prime, sieve def aupton(terms): p = [None] + list(sieve.primerange(1, prime(prime(terms))+1)) return [p[n] + p[p[n]] for n in range(1, terms+1)] print(aupton(51)) # Michael S. Branicky, May 08 2021 CROSSREFS Cf. A000040, A073065. Sequence in context: A357276 A088586 A350347 * A063924 A340997 A058566 Adjacent sequences: A073133 A073134 A073135 * A073137 A073138 A073139 KEYWORD easy,nonn AUTHOR Y. Kelly Itakura (yitkr(AT)mta.ca), Aug 22 2002 EXTENSIONS Corrected and extended by Michel Marcus, Jun 26 2013 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 April 22 22:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)