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.

A277544 a(n) = n/6^m mod 6, where 6^m is the greatest power of 6 that divides n.

Original entry on oeis.org

1, 2, 3, 4, 5, 1, 1, 2, 3, 4, 5, 2, 1, 2, 3, 4, 5, 3, 1, 2, 3, 4, 5, 4, 1, 2, 3, 4, 5, 5, 1, 2, 3, 4, 5, 1, 1, 2, 3, 4, 5, 1, 1, 2, 3, 4, 5, 2, 1, 2, 3, 4, 5, 3, 1, 2, 3, 4, 5, 4, 1, 2, 3, 4, 5, 5, 1, 2, 3, 4, 5, 2, 1, 2, 3, 4, 5, 1, 1, 2, 3, 4, 5, 2, 1, 2
Offset: 1

Views

Author

Clark Kimberling, Oct 19 2016

Keywords

Comments

a(n) is the rightmost nonzero digit in the base 6 expansion of n.

Examples

			a(8) = (8/6 mod 6) = 2.
		

Crossrefs

Programs

  • Mathematica
    Table[Mod[n/6^IntegerExponent[n, 6], 6], {n, 1, 160}]
  • PARI
    a(n) = n/6^valuation(n, 6) % 6; \\ Michel Marcus, Oct 20 2016

Formula

a(n) = A244414(n) mod 6. - Michel Marcus, Oct 20 2016