A259526 Smallest m such that A259260(m) = 2*n-1.

1, 6, 7, 2, 12, 3, 8, 20, 21, 9, 4, 13, 45, 14, 5, 10, 22, 27, 28, 23, 11, 50, 15, 46, 42, 47, 16, 51, 33, 24, 29, 61, 60, 30, 25, 34, 52, 17, 48, 41, 88, 105, 49, 18, 53, 35, 26, 31, 67, 62, 63, 68, 32, 58, 36, 54, 19, 91, 106, 87, 111, 94, 107, 90, 120, 55

Offset

1,2

Comments

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

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

Links

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

Prog

(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a259526 = (+ 1) . fromJust . (`elemIndex` a259260_list) . subtract 1 . (* 2)

Crossrefs

Cf. A259260.

Sequence in context: A308039 A316165 A267251 * A108664 A160155 A277135

Adjacent sequences: A259523 A259524 A259525 * A259527 A259528 A259529

Keyword

nonn

Author

Reinhard Zumkeller, Jun 29 2015

Status

approved