|
| |
|
|
A130508
|
|
a(1)=2. a(2)=3. a(3)=1. a(n+3) = 3 + a(n), for all positive integers n.
|
|
1
| |
|
|
2, 3, 1, 5, 6, 4, 8, 9, 7, 11, 12, 10, 14, 15, 13, 17, 18, 16, 20, 21, 19, 23, 24, 22, 26, 27, 25, 29, 30, 28, 32, 33, 31, 35, 36, 34, 38, 39, 37, 41, 42, 40, 44, 45, 43, 47, 48, 46
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| This sequence is a permutation of the positive integers, where each a(n) is the smallest positive integer not occurring earlier in the sequence such that the m-th term of the inverse permutation A130509 never equals a(m), for all positive integers m.
|
|
|
MATHEMATICA
| Transpose[NestList[{#[[2]], #[[3]], #[[1]]+3}&, {2, 3, 1}, 50]][[1]] (* From Harvey P. Dale, Sep 08 2011 *)
|
|
|
CROSSREFS
| Cf. A130509.
Sequence in context: A114690 A195508 A049274 * A182938 A055231 A160400
Adjacent sequences: A130505 A130506 A130507 * A130509 A130510 A130511
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Leroy Quet Jun 01 2007
|
| |
|
|
