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 A376898 #15 Oct 16 2024 20:17:54 %S A376898 1,2,5,7,10,11,14,15,22,30,37,41,49,61,74,98,122 %N A376898 Positive numbers k such that all the digits in the octal expansion of k^3 are distinct. %C A376898 There are no terms >= 2^8 because 2^24-1 is the largest eight-digit octal number. %e A376898 11 is a term because 11^3 = 1331 = 2463_8 in octal and no octal digit occurs more than once. %t A376898 Select[Range[2^8],Length[IntegerDigits[#^3,8]]==Length[Union[IntegerDigits[#^3,8]]]&] (* _James C. McMahon_, Oct 16 2024 *) %o A376898 (Python) %o A376898 for k in range(1, 2**8): %o A376898 octal = format(k**3, "o") %o A376898 if len(octal) == len(set(octal)): print(k, end=",") %Y A376898 Cf. A007094, A129525, A376897. %K A376898 base,fini,full,nonn %O A376898 1,2 %A A376898 _Kalle Siukola_, Oct 08 2024