|
| |
|
|
A097863
|
|
Sum of 5-infinitary divisors of n.
|
|
2
| |
|
|
1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 28, 14, 24, 24, 31, 18, 39, 20, 42, 32, 36, 24, 60, 31, 42, 40, 56, 30, 72, 32, 33, 48, 54, 48, 91, 38, 60, 56, 90, 42, 96, 44, 84, 78, 72, 48, 124, 57, 93, 72, 98, 54, 120, 72, 120, 80, 90, 60, 168, 62, 96, 104, 99, 84, 144, 68, 126, 96, 144, 72, 195, 74, 114, 124
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| If n=Product p_i^r_i and d=Product p_i^s_i, each s_i has a digit a<=b in its 5-ary expansion everywhere that the corresponding r_i has a digit b, then d is a 5-infinitary-divisor of n.
|
|
|
EXAMPLE
| a(32)=a(2^10)=2^10+2^0=32+1=33, in 5-ary expansion. This is the first term which is different from sigma(n)
|
|
|
MAPLE
| A097863 := proc(n) option remember; local ifa, a, p, e, d, k ; ifa := ifactors(n)[2] ; a := 1 ; if nops(ifa) = 1 then p := op(1, op(1, ifa)) ; e := op(2, op(1, ifa)) ; d := convert(e, base, 5) ; for k from 0 to nops(d)-1 do a := a*(p^((1+op(k+1, d))*5^k)-1)/(p^(5^k)-1) ; end do: else for d in ifa do a := a*procname( op(1, d)^op(2, d)) ; end do: return a; end if; end proc:
|
|
|
CROSSREFS
| Cf. A097464, A074847.
Sequence in context: A140782 A097011 A074847 * A097012 A143348 A000203
Adjacent sequences: A097860 A097861 A097862 * A097864 A097865 A097866
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp) Yasutoshi
|
| |
|
|
