A268531 - OEIS

A268531

Position of n in A268642 (or, inverse permutation to A268642).

1, 3, 2, 10, 7, 4, 17, 9, 6, 27, 19, 11, 24, 16, 8, 86, 21, 5, 65, 26, 18, 57, 31, 88, 62, 23, 15, 80, 54, 28, 98, 85, 20, 46, 33, 12, 77, 64, 25, 38, 95, 82, 69, 56, 30, 113, 100, 87, 74, 61, 22, 118, 35, 14, 149, 79, 66, 53, 123, 40, 110, 97, 84, 273, 71, 58, 128, 45, 32, 203, 102, 89, 146, 76, 63

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Apparently there is a claim that A268642 contains every positive integer exactly once, so this sequence is well-defined.

LINKS

N. J. A. Sloane, Table of n, a(n) for n = 1..945

MAPLE

# Let b1 be a list of the initial terms of A268642

ans:=[];

for n from 1 to nops(b1) do

if member(n, b1, 'p') then ans:=[op(ans), p];