OFFSET
1,2
COMMENTS
A self-inverse permutation of the positive integers. Let s(n)=n-1+Floor(n*tau) and F(n)=n-th Fibonacci number. Then F(n+1) is in position s(n) and s(n) is in position F(n+1).
LINKS
Peter J. C. Moses, Table of n, a(n) for n = 1..10000
FORMULA
Suppose (as at A114538) that T is a rectangular array consisting of all the positive integers, each exactly once. The transposition sequence of T is obtained by placing T(i, j) in position T(j, i) for all i and j.
EXAMPLE
Start with the northwest corner of the Wythoff array T (A035513):
1 2 3 5 8
4 7 11 18 29
6 10 16 26 42
9 15 24 39 63
a(1)=1 because 1=T(1,1) and T(1,1)=1.
a(2)=4 because 2=T(1,2) and T(2,1)=4.
a(3)=6 because 3=T(1,3) and T(3,1)=6.
a(15)=18 because 15=T(4,2) and T(2,4)=18.
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, Dec 09 2005
STATUS
approved