|
| |
|
|
A069192
|
|
Sum of the reversals of the divisors of n.
|
|
7
|
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Indranil Ghosh, Table of n, a(n) for n = 1..50000
Pe, J. The Picture-Perfect Numbers
|
|
|
EXAMPLE
|
The divisors of 10 are 1,2,5,10, which reversed are 1,2,5,1, summing to 9. Therefore a(10) = 9.
|
|
|
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}]
|
|
|
PROG
|
(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
|
|
|
CROSSREFS
|
Cf. A000203, A069250.
Sequence in context: A284344 A168338 A034690 * A076887 A140782 A284587
Adjacent sequences: A069189 A069190 A069191 * A069193 A069194 A069195
|
|
|
KEYWORD
|
base,nonn
|
|
|
AUTHOR
|
Joseph L. Pe, Apr 19 2002
|
|
|
EXTENSIONS
|
Added more terms, corrected offset. - N. J. A. Sloane, May 19 2013
|
|
|
STATUS
|
approved
|
| |
|
|
