|
|
|
|
|
|
|
|
|
#11 by Joerg Arndt at Sun Feb 16 00:59:29 EST 2020
|
|
|
|
|
|
|
|
#10 by Michel Marcus at Sat Feb 15 16:57:31 EST 2020
|
|
|
|
|
|
|
|
#9 by Peter Munn at Sat Feb 15 16:35:01 EST 2020
|
|
|
|
|
|
|
|
#8 by Peter Munn at Sat Feb 15 16:34:45 EST 2020
|
|
| KEYWORD
|
nonn,tabf
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#7 by Jon E. Schoenfield at Sun Aug 16 21:48:31 EDT 2015
|
|
|
|
|
|
|
|
#6 by Jon E. Schoenfield at Sun Aug 16 21:48:29 EDT 2015
|
|
| NAME
|
A list of all finite permutations in "PermUnrank3L" ordering. (Inverses of the permutations of A060117)..)
|
|
| EXAMPLE
|
Append to each an infinite amountnumber of fixed terms and we get a list of rearrangements of natural numbers, but with only a finite number of terms permuted:
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#5 by Charles R Greathouse IV at Thu May 01 02:46:42 EDT 2014
|
|
| AUTHOR
|
_Antti Karttunen _, Mar 02 2001
|
|
|
|
|
Discussion
|
| Thu May 01
| 02:46
| OEIS Server: https://oeis.org/edit/global/2205
|
|
|
|
|
|
|
#4 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
|
|
| EXAMPLE
|
Append to each an infinite amount of fixed terms, and we get a list of rearrangements of natural numbers, but with only a finite number of terms permuted:
|
|
| KEYWORD
|
nonn,new
nonn
|
|
|
|
|
|
|
#3 by N. J. A. Sloane at Fri Feb 24 03:00:00 EST 2006
|
|
| FORMULA
|
[seq(op(PermUnrank3L(j)),)), j=0..)]; (Maple code given below)
|
|
| KEYWORD
|
nonn,new
nonn
|
|
|
|
|
|
|
#2 by N. J. A. Sloane at Sat Sep 13 03:00:00 EDT 2003
|
|
| KEYWORD
|
nonn,new
nonn
|
|
| AUTHOR
|
Antti Karttunen 02 Mar 02 2001
|
|
|
|
|
|
