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.

A272685 a(n) = smallest m such that A265432(m) = A272684(n), or -1 if no such m exists.

Original entry on oeis.org

1, 15, 14, 13, 12, 217, 0, 215, 45, 213, 44, 43, 209, 42, 207, 2, 573, 1327, 572, 130, 185, 570, 1492, 569, 78, 568, 128, 567, 1318, 1498, 565, 188, 564, 10, 563, 1312, 562, 1504, 1309, 560, 1507, 693, 74, 558, 1510, 557, 192, 2360, 6085, 350, 1480, 708, 6083, 3643
Offset: 1

Views

Author

Keywords

Comments

It is conjectured that all terms of A272684 eventually appear in A265432.
See A273369 for a version that ignores the fact that terms in A272671 ending in 0 cannot appear in A265432.

Examples

			A272684(1) = 6 first appears in A265432 at index 1, so a(1) = 1.
A272684(7) = 225 first appears in A265432 at index 0, so a(7) = 0.
		

Crossrefs

See A273369 for another version.