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.

Showing 1-1 of 1 results.

A361324 a(n) = k such that A361321(k) = A000469(n), or -1 if A000469(n) never appears in A361321.

Original entry on oeis.org

1, 2, 3, 8, 11, 5, 7, 15, 24, 6, 18, 4, 19, 10, 14, 30, 21, 12, 20, 34, 38, 16, 33, 25, 23, 42, 13, 37, 48, 17, 53, 45, 9, 50, 58, 28, 83, 36, 61, 29, 55, 79, 40, 62, 22, 65, 49, 54, 66, 27, 69, 41, 59, 70, 32, 35, 73, 47, 39, 74, 60, 26, 44, 87, 78, 93, 63, 98, 52, 64, 43, 101, 77, 86, 102
Offset: 1

Views

Author

Keywords

Comments

Conjectured to be a permutation of the natural numbers (and if so, -1 will never appear).

Crossrefs

Showing 1-1 of 1 results.