A259537 Smallest m such that A259429(m) = 2*n-1.

1, 56, 48, 147, 148, 49, 55, 2, 8, 14, 20, 26, 32, 38, 33, 27, 21, 15, 9, 3, 66, 50, 149, 158, 177, 57, 74, 88, 102, 116, 130, 45, 44, 131, 117, 103, 89, 75, 58, 178, 157, 150, 51, 65, 4, 10, 16, 22, 28, 34, 39, 139, 125, 111, 97, 83, 496, 186, 196, 163, 173

Offset

1,2

Comments

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

A259429(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)
a259537 = (+ 1) . fromJust . (`elemIndex` a259429_list) . subtract 1 . (* 2)

Crossrefs

Cf. A259429.

Sequence in context: A224343 A369234 A278826 * A359604 A292092 A003904

Adjacent sequences: A259534 A259535 A259536 * A259538 A259539 A259540

Keyword

nonn

Author

Reinhard Zumkeller, Jun 30 2015

Status

approved