|
|
A306985
|
|
Numbers k such that isigma(k) = isigma(k+1), where isigma(k) is the sum of the infinitary divisors of k (A049417).
|
|
23
|
|
|
14, 27, 44, 459, 620, 957, 1334, 1634, 1652, 2204, 2685, 3195, 3451, 3956, 4064, 4544, 5547, 8495, 8636, 8907, 9844, 11515, 15296, 19491, 20145, 20155, 27643, 31724, 33998, 38180, 41265, 41547, 42818, 45716, 48364, 61964, 64665, 74875, 74918, 79316, 79826
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
a(n) differs from A293183(n) starting at n = 15.
|
|
LINKS
|
|
|
EXAMPLE
|
14 is in the sequence since isigma(14) = isigma(15) = 24.
|
|
MATHEMATICA
|
fun[p_, e_] := Module[{ b = IntegerDigits[e, 2]}, m=Length[b]; Product[If[b[[j]]>0, 1+p^(2^(m-j)), 1], {j, 1, m}]]; isigma[1]=1; isigma[n_] := Times @@ fun @@@ FactorInteger[n]; aQ[n_] := isigma[n] == isigma[n+1]; Select[Range[1000], aQ]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|