A259543 Smallest m such that A259542(m) = 2*n-1.

1, 6, 2, 3, 7, 8, 4, 19, 5, 9, 14, 10, 24, 20, 21, 25, 11, 15, 16, 12, 26, 22, 37, 23, 27, 13, 17, 56, 18, 32, 28, 42, 38, 39, 43, 29, 33, 51, 55, 54, 50, 34, 30, 44, 40, 71, 41, 45, 31, 35, 57, 53, 92, 52, 58, 36, 68, 46, 76, 72, 73, 77, 47, 67, 63, 59, 87

Offset: 1

Author

Reinhard Zumkeller, Jun 30 2015

Keywords

• nonn

Comments

Sequence is defined for all n iff A259542 is a permutation of the odd numbers;

A259542(a(n)) = 2*n-1.

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A259542.

Programs

Haskell

import Data.List (elemIndex); import Data.Maybe (fromJust)
a259543 = (+ 1) . fromJust . (`elemIndex` a259542_list) . subtract 1 . (* 2)