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.

A290825 Least base-3 digit of n.

Original entry on oeis.org

0, 1, 2, 0, 1, 1, 0, 1, 2, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Robert Israel, Aug 11 2017

Keywords

Examples

			11 = 102_3 so a(11)=0.
		

Crossrefs

Programs

  • Maple
    seq(min(convert(n,base,3)),n=0..100);
  • Mathematica
    Table[Min[IntegerDigits[n,3]],{n,0,120}] (* Harvey P. Dale, Dec 19 2017 *)
  • PARI
    a(n) = if (n==0, 0, vecmin(digits(n, 3))); \\ Michel Marcus, Aug 12 2017

Formula

a(n) = 2 if and only if n > 0 is in A024023.
a(n) = 0 if n is divisible by 3.
a(n) = min(A010872(n), a(A002264(n))).