login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060800 a(n) = p^2+p+1 where p runs through the primes. 13
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; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

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.

MAPLE

A060800:= n -> map (p -> p^(2)+p+1, ithprime(n)):

seq (A060800(n), n=1..41); # - Jani Melik, Jan 25 2011

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]

PROG

(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: A181141 A031158 A091431 * A107146 A201601 A129781

Adjacent sequences:  A060797 A060798 A060799 * 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 16:30 EST 2012. Contains 206050 sequences.