|
| |
|
|
A110959
|
|
Numbers n such that (23*n^2) + 1 is prime.
|
|
1
| |
|
|
6, 12, 24, 66, 72, 84, 90, 96, 132, 144, 150, 162, 174, 180, 186, 204, 210, 216, 222, 234, 252, 264, 288, 342, 360, 372, 384, 390, 396, 408, 438, 444, 456, 474, 516, 522, 534, 546, 576, 606, 612, 630, 648, 702, 720, 750, 762, 768, 780, 810, 828, 834, 840, 882
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Are all the terms in this sequence divisible by 6?
Let's look at the sequence in base 12 with X for ten and E for eleven. Recall that all primes greater than three end in a 1, 5, 7, or E. The sequence [n,(23*n^2+1)mod 12], 0<=n<=11, is [0, 1], [1, 0], [2, 9], [3, 4], [4, 9], [5, 0], [6, 1], [7, 0], [8, 9], [9, 4], [10, 9], [11, 0]. Thus the only possible primes are in 0 or 6 mod 12, that is, all multiples of 6 and all such primes end in 1. The sequence in base 12 is [6,591],[10,1E01], [20,7801], [56,49E91], [60,59001], [70,79E01], [76,8E991], [80,X2801]. - Walter A. Kehowski (wkehowski(AT)cox.net), Oct 05 2005
|
|
|
EXAMPLE
| If n=144 then (23*n^2) + 1 = 476929 (prime).
|
|
|
MAPLE
| select(proc(z) isprime(z[2]) end, [seq([n, 23*n^2 + 1], n=0..9*12)]); (Kehowski)
|
|
|
PROG
| A110959 (MAGMA) [n: n in [0..10000] |IsPrime((23*n^2)+1)] [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 13 2010]
|
|
|
CROSSREFS
| Sequence in context: A091629 A089529 A001766 * A202805 A065106 A177282
Adjacent sequences: A110956 A110957 A110958 * A110960 A110961 A110962
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Sep 26 2005
|
| |
|
|
