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.

A333862 a(n) is the greatest nim-power of n.

Original entry on oeis.org

1, 1, 3, 3, 15, 15, 15, 15, 14, 15, 14, 15, 15, 14, 14, 15, 252, 252, 255, 255, 252, 252, 255, 255, 252, 252, 255, 255, 255, 255, 252, 252, 255, 255, 255, 255, 252, 255, 252, 255, 255, 255, 255, 255, 255, 252, 255, 252, 255, 252, 252, 255, 255, 255, 255, 255
Offset: 0

Views

Author

Rémy Sigrist, Jun 13 2020

Keywords

Comments

For any n >= 0, a(n) is the greatest term in n-th row of A335162.

Examples

			For n = 10:
- the first nim-powers of 10 are: 1, 10, 14, 13, 8, 1, ...
- so a(10) = 14.
		

Crossrefs

Cf. A335162.

Programs

  • C
    See Links section.