1,2

Conjecture: integer permutation with inverse A095259: a(A095259(n))=A095259(a(n))=n. - Comment revised: Reinhard Zumkeller, Dec 31 2014

A095260(n) = a(a(n)).

First fixed points: 1,4,54,416, ...

A253415(n) = smallest missing number within the first n terms. - Reinhard Zumkeller, Dec 31 2014

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

Index entries for sequences that are permutations of the natural numbers

(Haskell)

import Data.List (delete)

a095258 n = a095258_list !! (n-1)

a095258_list = 1 : f [2..] 1 where

f xs z = g xs where

g (y:ys) = if mod z' y > 0 then g ys else y : f (delete y xs) (z + y)

z' = z + 2

-- Reinhard Zumkeller, Dec 31 2014

Cf. A253415.

Sequence in context: A116425 A019653 A240493 * A114745 A039915 A085346

Adjacent sequences: A095255 A095256 A095257 * A095259 A095260 A095261

nonn

Reinhard Zumkeller, May 31 2004

approved