A091263 Inverse permutation to A091023.

1, 2, 4, 7, 11, 5, 13, 20, 10, 22, 8, 24, 3, 26, 40, 23, 42, 19, 44, 17, 46, 15, 48, 12, 50, 6, 52, 79, 49, 81, 45, 83, 41, 85, 38, 87, 36, 89, 34, 91, 32, 93, 30, 95, 28, 97, 25, 99, 18, 101, 14, 103, 155, 100, 157, 96, 159, 92, 161, 88, 163, 84, 165, 80, 167, 77, 169, 75

Offset: 1

Author

N. J. A. Sloane, following a suggestion of Leroy Quet, Feb 23 2004

Keywords

• nonn
• easy

Comments

Let S_n be the set of all positive integers except a(1), a(2), ..., a(n-1) and a(n). Let k_n be the number of members of S_n that are less than a(n). (k_n = A091068(n+1).) If k_n >= n, then a(n+1) is the (1+k_n-n)th member of S_n; if k_n < n then a(n+1) is the (k_n+n)th member of S_n. - David Wasserman, Feb 23 2006

Links

• Charlie Neder, Table of n, a(n) for n = 1..1000

Extensions

More terms from John W. Layman, Feb 25 2004