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.

A021027 Decimal expansion of 1/23.

Original entry on oeis.org

0, 4, 3, 4, 7, 8, 2, 6, 0, 8, 6, 9, 5, 6, 5, 2, 1, 7, 3, 9, 1, 3, 0, 4, 3, 4, 7, 8, 2, 6, 0, 8, 6, 9, 5, 6, 5, 2, 1, 7, 3, 9, 1, 3, 0, 4, 3, 4, 7, 8, 2, 6, 0, 8, 6, 9, 5, 6, 5, 2, 1, 7, 3, 9, 1, 3, 0, 4, 3, 4, 7, 8, 2, 6, 0, 8, 6, 9, 5, 6, 5, 2, 1, 7, 3, 9, 1, 3, 0, 4, 3, 4, 7, 8, 2, 6, 0, 8, 6
Offset: 0

Views

Author

Keywords

Comments

Since 23 is prime and the cycle of its reciprocal's base 10 digits is 22, 23 is a full reptend prime in base 10 (A001913). - Alonso del Arte, Mar 26 2020

Examples

			1/23 = 0.043478260869565217391304347826...
		

Crossrefs

Cf. A001913.

Programs

  • Mathematica
    Join[{0}, RealDigits[1/23, 10, 100][[1]]] (* Alonso del Arte, Mar 14 2020 *)
  • Scala
    def longDivRecip(n: Int, places: Int = 100): List[Int] = {
      val pow10 = Math.pow(10, Math.ceil(Math.log10(Math.abs(n)))).toInt
      val digits = new scala.collection.mutable.ListBuffer[Int]()
      var quotient = pow10; var remainder = 0
      while (digits.size < places) {
        remainder = quotient % n; quotient /= n; digits += quotient
        quotient = remainder * 10
      }
      digits.toList
    }
    0 :: longDivRecip(23) // Alonso del Arte, Mar 25 2020