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.

A376898 Positive numbers k such that all the digits in the octal expansion of k^3 are distinct.

Original entry on oeis.org

1, 2, 5, 7, 10, 11, 14, 15, 22, 30, 37, 41, 49, 61, 74, 98, 122
Offset: 1

Views

Author

Kalle Siukola, Oct 08 2024

Keywords

Comments

There are no terms >= 2^8 because 2^24-1 is the largest eight-digit octal number.

Examples

			11 is a term because 11^3 = 1331 = 2463_8 in octal and no octal digit occurs more than once.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[2^8],Length[IntegerDigits[#^3,8]]==Length[Union[IntegerDigits[#^3,8]]]&] (* James C. McMahon, Oct 16 2024 *)
  • Python
    for k in range(1, 2**8):
        octal = format(k**3, "o")
        if len(octal) == len(set(octal)): print(k, end=",")