|
Search: id:A101635
|
|
|
| A101635 |
|
Increasing primes of alternating congruences modulo 6. |
|
+0
1
|
|
| 5, 7, 11, 13, 17, 19, 23, 31, 41, 43, 47, 61, 71, 73, 83, 97, 101, 103, 107, 109, 113, 127, 131, 139, 149, 151, 167, 181, 191, 193, 197, 199, 227, 229, 233, 241, 251, 271, 281, 283, 293, 307, 311, 313, 317, 331, 347, 349, 353, 367, 383, 397, 401, 409, 419, 421
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(2n) == 1 (mod 6) & a(2n+1) == -1 (mod 6).
|
|
MAPLE
|
a[1] = 5; a[n_] := a[n] = Block[{k = a[n - 1] + 3 + If[ Mod[a[n - 1], 3] == 1, 1, -1]}, While[ !PrimeQ[k], k += 6]; k]; Table[ a[n], {n, 60}]
|
|
CROSSREFS
|
Cf. A100859.
Adjacent sequences: A101632 A101633 A101634 this_sequence A101636 A101637 A101638
Sequence in context: A020602 A020617 A020589 this_sequence A118941 A096547 A128824
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ray Chandler (rayjchandler(AT)sbcglobal.net) and Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 25 2005
|
|
|
Search completed in 0.002 seconds
|
