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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152532 a(n) = p(n)*p(n+2) - 2*p(n+1), where p(n) is the n-th prime. 5
4, 11, 41, 69, 161, 213, 353, 505, 655, 1011, 1197, 1509, 1841, 2185, 2667, 3115, 3831, 4197, 4749, 5463, 5901, 6865, 7873, 8795, 9789, 10601, 11013, 11873, 13617, 14549, 17137, 17935, 20135, 20691, 23091, 24299, 25893, 27865 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Ingo Althofer, Is 8795 a boring number? [From Omar E. Pol (info(AT)polprimos.com), Feb 20 2009]

Charles R Greathouse IV, Uninteresting numbers. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 30 2009]

MATHEMATICA

First[#]Last[#]-2#[[2]]&/@Partition[Prime[Range[100]], 3, 1] (* From Harvey P. Dale, June 16 2011 *)

CROSSREFS

Cf. A111071, A152527, A152528, A152529, A152530, A152531.

Sequence in context: A149267 A149268 A077236 * A121096 A047091 A121092

Adjacent sequences:  A152529 A152530 A152531 * A152533 A152534 A152535

KEYWORD

easy,nonn

AUTHOR

Omar E. Pol (info(AT)polprimos.com), Dec 06 2008

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 06:27 EST 2012. Contains 205998 sequences.