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.

A265143 Least positive integer n having only the digits 0 or 1 in base 3, such that the product with A263488(n) also has only digits 0 or 1 in base 3.

Original entry on oeis.org

1, 1, 1, 4, 1, 1, 1, 1, 13, 4, 37, 13, 1, 1, 1, 1, 31, 1, 1, 1, 1, 40, 13, 118, 4, 4, 4, 37, 109, 4, 10, 13, 10, 40, 1, 1, 1, 1, 4, 1, 1, 1, 1, 31, 10, 31, 2548, 6898, 1, 1, 1, 1, 256, 1, 1, 1, 1, 121, 40, 1081, 13, 13, 1081, 118, 352, 112, 121, 4, 37, 13, 4, 4, 4, 1054, 13, 37, 27004, 109, 325, 4, 26500, 4, 280, 7546, 121, 10, 10, 31, 13, 271
Offset: 1

Views

Author

Jeffrey Shallit, Dec 02 2015

Keywords

Comments

The sequence A263488 are those n that can be written as the quotient of two elements of A005836. The two corresponding elements of A005836 for A263488(i) are therefore A265143(i)*A263488(i) and A265143(i).

Crossrefs

Showing 1-1 of 1 results.