cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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
Offset: 1

Views

Author

N. J. A. Sloane, Feb 17 2016

Keywords

Comments

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

Crossrefs

Cf. A268642.

Programs

  • 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];
       else lprint("missed", n); break; fi;
    od;
    ans;