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.

A103162 GCD of reverse(3^n) and reverse(3^(n+1)).

Original entry on oeis.org

3, 9, 18, 18, 9, 9, 36, 9, 27, 27, 9, 9, 9, 9, 9, 27, 9, 63, 9, 9, 9, 9, 27, 18, 36, 9, 9, 18, 18, 18, 9, 9, 9, 9, 4941, 9, 9, 9, 9, 9, 9, 9, 9, 9, 144, 18, 9, 153, 333, 63, 18, 9, 27, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 18, 18, 9, 9, 18, 18, 18, 9, 9, 9, 9, 9, 9, 9, 9, 9, 81, 9, 9, 9, 9, 54
Offset: 1

Views

Author

Labos Elemer, Jan 25 2005

Keywords

Examples

			These common divisors are always divisible by 3.
		

Crossrefs

Cf. A004167.

Programs

  • Mathematica
    rd[x_] :=FromDigits[Reverse[IntegerDigits[x]]] Table[GCD[rd[3^w], rd[3^(w+1)]], {w, 1, 100}]

Formula

a(n) = GCD(A004167(n), A004167(n+1)).