|
Search: id:A100812
|
|
|
| A100812 |
|
{a(n)} is monotone increasing, with a(1)=1, a(2)=3, and, for n>2, a(n) is the smallest integer such that a(n) mod a(j) is never a(i) for any pair i,j with 1<=i<j<n. |
|
+0
1
|
|
| 1, 3, 5, 9, 15, 17, 27, 29, 45, 47, 87, 89, 135, 227, 267, 269, 540, 674, 947, 1217, 1442, 1485, 2522, 2564, 2792, 2832, 2834, 2972, 3102, 3240, 3242, 3645, 3737, 4142, 4182, 4320, 4992, 5400, 5807, 6077, 7017, 7967, 8370, 8772, 8774, 9677, 9717, 9990, 9992
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(8)<>28, since 28=1 mod 27. But the residues of 29 modulo 3,5,9,15,17, and 27 are 2,4,2,14,12, and 2, none of which are earlier terms of the sequence, so a(8)=29.
|
|
CROSSREFS
|
Adjacent sequences: A100809 A100810 A100811 this_sequence A100813 A100814 A100815
Sequence in context: A093688 A143512 A111249 this_sequence A018634 A029533 A018685
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
John W. Layman (layman(AT)math.vt.edu), Jan 05 2005
|
|
|
Search completed in 0.002 seconds
|
