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.

A008713 16 in base 16-n.

Original entry on oeis.org

10, 11, 12, 13, 14, 15, 16, 17, 20, 22, 24, 31, 100, 121, 10000, 1111111111111111
Offset: 0

Views

Author

Keywords

Examples

			16 = 121_3, so a(13) = 121.
		

References

  • J. J. Clessa, Micropuzzles, Pan Books, 1983, p. 31 (puzzle 51).
  • GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See pages 108 and 300.

Programs

  • PARI
    a(n) = if (n <= 15, fromdigits(digits(16, 16-n), 10), 1111111111111111); \\ Michel Marcus, Aug 06 2017