|
| |
|
|
A100859
|
|
Beginning with 3, increasing primes such that no two adjacent terms are congruent mod 4.
|
|
1
| |
|
|
3, 5, 7, 13, 19, 29, 31, 37, 43, 53, 59, 61, 67, 73, 79, 89, 103, 109, 127, 137, 139, 149, 151, 157, 163, 173, 179, 181, 191, 193, 199, 229, 239, 241, 251, 257, 263, 269, 271, 277, 283, 293, 307, 313, 331, 337, 347, 349, 359, 373, 379, 389, 419, 421, 431, 433
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
FORMULA
| a(2n-1)==3 (mod 4) and a(2n)==1 (mod 4).
|
|
|
MATHEMATICA
| Clear[a]; a[1] = 3; a[n_] := a[n] = Block[{k}, k = a[n - 1] + 2; While[ ! PrimeQ[k], k = k + 4]; Return[k]; ]; Table[a[n], {n, 100}]
|
|
|
CROSSREFS
| Sequence in context: A155189 A065384 A126108 * A111703 A184248 A206023
Adjacent sequences: A100856 A100857 A100858 * A100860 A100861 A100862
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Jan 13 2005
|
|
|
EXTENSIONS
| Edited and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 19 2005
|
| |
|
|
