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.

A069192 Sum of the reversals of the divisors of n.

Original entry on oeis.org

1, 3, 4, 7, 6, 12, 8, 15, 13, 9, 12, 37, 32, 51, 60, 76, 72, 102, 92, 15, 23, 36, 33, 87, 58, 96, 85, 137, 93, 72, 14, 99, 48, 117, 66, 190, 74, 177, 128, 27, 15, 96, 35, 84, 123, 99, 75, 232, 102, 66, 90, 125, 36, 219, 72, 210, 170, 180, 96, 105, 17, 42, 68, 145, 93, 144, 77, 207, 132, 117, 18, 267, 38, 123, 169, 248
Offset: 1

Views

Author

Joseph L. Pe, Apr 19 2002

Keywords

Examples

			The divisors of 10 are 1,2,5,10, which reversed are 1,2,5,1, summing to 9. Therefore a(10) = 9.
		

Crossrefs

Programs

  • Maple
    read("transforms") ;
    A069192 := proc(n)
            add(digrev(d),d=numtheory[divisors](n)) ;
    end proc: # R. J. Mathar, Sep 09 2015
  • Mathematica
    f[n_] := FromDigits[Reverse[IntegerDigits[n]]]; g[n_] := Apply[Plus, Map[f, Divisors[n]]]; Table[g[i], {i, 1, 40}]
  • Python
    def A069192(n):
        s=0
        for i in range(1,n+1):
            if n%i==0: s+=int(str(i)[::-1])
        return s # Indranil Ghosh, Feb 10 2017

Extensions

Added more terms, corrected offset. - N. J. A. Sloane, May 19 2013