cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A096689 Numbers n such that 2n^2 + 3n + 3 is prime.

Original entry on oeis.org

0, 2, 4, 10, 16, 20, 26, 34, 40, 44, 46, 50, 62, 64, 74, 76, 80, 82, 86, 92, 94, 110, 122, 140, 160, 164, 170, 176, 182, 200, 202, 212, 214, 220, 224, 232, 236, 250, 262, 296, 302, 304, 310, 320, 322, 326, 332, 344, 346, 352, 392, 400, 404, 422, 424, 446, 452
Offset: 1

Views

Author

Ray Chandler, Jul 12 2004

Keywords

Comments

All n are {2,4} (mod 6), as in A047235, because otherwise 2*n^2 + 3*n + 3 is a multiple of 2 or 3. - R. J. Mathar, Jul 17 2012

Crossrefs

Programs

Formula

a(n) = A096691(n)*2.