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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023268 Numbers n such that n remains prime through 2 iterations of function f(x) = 9x + 10. 0
11, 13, 43, 47, 67, 83, 89, 103, 109, 193, 197, 251, 281, 293, 383, 397, 449, 461, 601, 617, 641, 733, 757, 823, 839, 853, 887, 937, 967, 1013, 1069, 1091, 1447, 1489, 1733, 1741, 1789, 1931, 2111, 2237, 2239, 2251, 2339, 2521, 2539, 2647, 2671, 2693, 2797 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

n, 9*n+10 and 81*n+100 are primes. [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 04 2010]

PROG

(MAGMA) [n: n in [1..100000] | IsPrime(n) and IsPrime(9*n+10) and IsPrime(81*n+100)] [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 04 2010]

CROSSREFS

Sequence in context: A132241 A045467 A108264 * A154292 A188386 A027450

Adjacent sequences:  A023265 A023266 A023267 * A023269 A023270 A023271

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 19:15 EST 2012. Contains 205852 sequences.