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.

A070246 a(n) = lcm(n, R(n)) / gcd(n, R(n)), where R(n) (A004086) is the digit reversal of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 28, 403, 574, 85, 976, 1207, 18, 1729, 10, 28, 1, 736, 28, 1300, 403, 24, 574, 2668, 10, 403, 736, 1, 1462, 1855, 28, 2701, 3154, 403, 10, 574, 28, 1462, 1, 30, 736, 3478, 28, 4606, 10, 85, 1300, 1855, 30, 1, 3640, 475, 4930, 5605
Offset: 1

Views

Author

Amarnath Murthy, May 09 2002

Keywords

Comments

a(1) = 1, a(18) = 18. Are there more terms for which a(k) = k?

Examples

			a(12) = lcm(12,21)/gcd(12,21) = 84/3 = 28.
		

Programs

  • Mathematica
    r[n_] := FromDigits[ Reverse[ IntegerDigits[n]]]; Table[ LCM[n, r[n]] / GCD[n, r[n]], {n, 1, 65}]

Extensions

Edited by Robert G. Wilson v, May 10 2002