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.
%I A265143 #10 Dec 03 2015 04:44:41 %S A265143 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, %T A265143 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, %U A265143 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 %N 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. %C A265143 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). %H A265143 Jeffrey Shallit, <a href="/A265143/b265143.txt">Table of n, a(n) for n = 1..399</a> %Y A265143 Cf. A005836, A263488, A265143. %K A265143 nonn,base %O A265143 1,4 %A A265143 _Jeffrey Shallit_, Dec 02 2015