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.

A004286 Least positive multiple of n written in base 6 using only 0 and 1.

Original entry on oeis.org

1, 10, 10, 100, 11111, 10, 11, 1000, 100, 111110, 1101, 100, 10111, 110, 111110, 10000, 11001, 100, 101011, 1111100, 110, 11010, 1101, 1000, 111101, 101110, 1000, 1100, 1010111, 111110, 1001, 100000, 11010, 110010, 1111111111, 100, 101, 1010110, 101110, 11111000
Offset: 1

Views

Author

Keywords

Programs

  • PARI
    a(n) = {k=1; while (vecmax(digits(k*n, 6)) != 1, k++); subst(Pol(digits(k*n, 6)), x, 10);}

Extensions

a(29) corrected by Sean A. Irvine, Dec 26 2015
More terms from Michel Marcus, Dec 27 2015