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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023276 Numbers n such that n remains prime through 3 iterations of function f(x) = 2x + 9. 0
5, 11, 31, 71, 281, 521, 911, 1181, 2371, 2521, 3391, 3701, 4211, 4931, 5051, 7211, 7411, 8221, 8431, 8461, 8501, 8641, 8951, 9601, 9871, 10301, 11981, 12421, 13121, 13921, 14591, 16381, 16451, 16901, 16931, 17791, 17881, 19391, 19751, 21991, 23021 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

n, 2*n+9, 4*n+27 and 8*n+63 are primes. [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 04 2010]

PROG

(MAGMA) [n: n in [1..100000] | IsPrime(n) and IsPrime(2*n+9) and IsPrime(4*n+27) and IsPrime(8*n+63)] [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 04 2010]

CROSSREFS

Sequence in context: A038580 A106088 A077446 * A074648 A106908 A107442

Adjacent sequences:  A023273 A023274 A023275 * A023277 A023278 A023279

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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 15 23:21 EST 2012. Contains 205860 sequences.