|
Search: id:A060800
|
|
|
| A060800 |
|
a(n) = p^2+p+1 where p runs through the primes. |
|
+0
12
|
|
| 7, 13, 31, 57, 133, 183, 307, 381, 553, 871, 993, 1407, 1723, 1893, 2257, 2863, 3541, 3783, 4557, 5113, 5403, 6321, 6973, 8011, 9507, 10303, 10713, 11557, 11991, 12883, 16257, 17293, 18907, 19461, 22351, 22953, 24807, 26733, 28057, 30103, 32221
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n) = 1 + A008864(n)*A000040(n) = (A030078(n) - 1)/A006093(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 06 2007
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
EXAMPLE
|
a(3)=31 because 5^2 + 5 + 1 = 31.
|
|
MATHEMATICA
|
f[n_]:=n^2+n+1; lst={}; Do[p=Prime[n]; AppendTo[lst, f[p]], {n, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Jul 24 2009]
|
|
PROGRAM
|
(PARI) { n=0; forprime (p=2, prime(1000), write("b060800.txt", n++, " ", p^2 + p + 1); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 13 2009]
|
|
CROSSREFS
|
Equals A036690 + 1.
Cf. A001248, A131991, A131992, A131993.
Sequence in context: A162652 A031158 A091431 this_sequence A107146 A129781 A040061
Adjacent sequences: A060797 A060798 A060799 this_sequence A060801 A060802 A060803
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Apr 27 2001
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), May 03 2001
|
|
|
Search completed in 0.002 seconds
|
