|
Search: id:A030298
|
|
|
| A030298 |
|
List of permutations of 1,2,3,...,n for n=1,2,3,..., in lexicographic order. |
|
+0
17
|
|
| 1, 1, 2, 2, 1, 1, 2, 3, 1, 3, 2, 2, 1, 3, 2, 3, 1, 3, 1, 2, 3, 2, 1, 1, 2, 3, 4, 1, 2, 4, 3, 1, 3, 2, 4, 1, 3, 4, 2, 1, 4, 2, 3, 1, 4, 3, 2, 2, 1, 3, 4, 2, 1, 4, 3, 2, 3, 1, 4, 2, 3, 4, 1, 2, 4, 1, 3, 2, 4, 3, 1, 3, 1, 2, 4, 3, 1, 4, 2, 3, 2, 1, 4, 3, 2, 4, 1, 3, 4, 1, 2, 3, 4, 2, 1, 4, 1, 2, 3, 4, 1, 3, 2, 4, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Contains every finite sequence of distinct numbers...infinitely many times.
|
|
FORMULA
|
Start with 1, then 12 and 21, then the 6 permutations of 123 in lexical order: 123, 132, 213, 231, 312, 321, and so on.
|
|
EXAMPLE
|
The permutations can be written as
1,
12, 21,
123, 132, 213, 231, 312, 321, etc.
Write them in order and insert commas.
|
|
CROSSREFS
|
Cf. A098280, A098281.
Sequence in context: A016533 A122915 A098282 this_sequence A098281 A103343 A085263
Adjacent sequences: A030295 A030296 A030297 this_sequence A030299 A030300 A030301
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
EXTENSIONS
|
Entry revised Feb 02 2006 by njas
|
|
|
Search completed in 0.002 seconds
|
