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.

A072349 a(n) = m such that A064388(m) = n, or 0 if no such m exists.

Original entry on oeis.org

1, 4, 2, 934, 932, 3, 5, 16, 14, 12, 10, 8, 6, 31, 29, 27, 25, 23, 236, 7, 9, 11, 13, 15, 17, 64, 62, 60, 58, 56, 54, 52, 50, 48, 46, 44, 42, 40
Offset: 1

Views

Author

David Wasserman, Jul 17 2002

Keywords

Comments

Next term, a(39), is either 0 or greater than 400000. My guess is that this sequence is not computable, i.e., there is some n that does not occur in A064388, but it is impossible to prove this.

Crossrefs

Cf. A057167.