login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A103162
GCD of reverse(3^n) and reverse(3^(n+1)).
0
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,1
FORMULA
a(n) = GCD(A004167(n), A004167(n+1)).
EXAMPLE
These common divisors are always divisible by 3.
MATHEMATICA
rd[x_] :=FromDigits[Reverse[IntegerDigits[x]]] Table[GCD[rd[3^w], rd[3^(w+1)]], {w, 1, 100}]
CROSSREFS
Cf. A004167.
Sequence in context: A109228 A376636 A355636 * A310331 A261952 A066006
KEYWORD
base,nonn
AUTHOR
Labos Elemer, Jan 25 2005
STATUS
approved