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.

A366264 Inverse of A366263, where A366263 is the Doudna sequence permuted by Blue code.

Original entry on oeis.org

0, 1, 3, 2, 5, 4, 15, 7, 6, 14, 17, 13, 51, 16, 12, 8, 85, 11, 255, 19, 18, 50, 257, 22, 10, 84, 9, 49, 771, 21, 1285, 25, 48, 254, 20, 28, 3855, 256, 86, 52, 4369, 55, 13107, 87, 23, 770, 21845, 59, 30, 31, 252, 253, 65535, 26, 54, 82, 258, 1284, 65537, 62, 196611, 3854, 53, 42, 80, 81, 327685, 259, 768, 61, 983055
Offset: 1

Views

Author

Antti Karttunen, Oct 06 2023

Keywords

Crossrefs

Cf. A156552, A193231, A366263 (inverse map).

Programs

  • PARI
    A156552(n) = {my(f = factor(n), p, p2 = 1, res = 0); for(i = 1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p * p2 * (2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); res}; \\ From A156552
    A193231(n) = { my(x='x); subst(lift(Mod(1, 2)*subst(Pol(binary(n), x), x, 1+x)), x, 2) };
    A366264(n) = A193231(A156552(n));

Formula

a(n) = A193231(A156552(n)).
For all n >= 0, a(A366263(n)) = n, and for all n >= 1, A366263(a(n)) = n.
For all n >= 2, 1+A268389(a(n)) = A055396(n).