editing
approved
editing
approved
Module[{nn=10, ad, th}, ad={#[[1]], #[[2]]}&/@Partition[Accumulate[ DivisorSigma[ 1, Range[nn]]], 2, 1]; th=Thread[{Range[2, nn], ad}]; Join[ {0, 1}, Flatten[Table[#[[1]], #[[2, 2]]-#[[2, 1]]]&/@th]]] (* Harvey P. Dale, Aug 29 2020 *)
approved
editing
Alois P. Heinz, <a href="/A185283/b185283_1.txt">Table of n, a(n) for n = 0..100000</a> (terms n = 1..1000 from G. C. Greubel)
editing
approved
Alois P. Heinz, <a href="/A185283/b185283_1.txt">Table of n, a(n) for n = 0..100000</a> (terms n = 1..1000 from G. C. Greubel)
G. CAlois P. Greubel, Heinz, <a href="/A185283/b185283_1.txt">Table of n, a(n) for n = 10..1000100000</a>
b:= proc(n) option remember; `if`(n=0, 0,
numtheory[sigma](n)+b(n-1))
end:
a:= proc(n) option remember; local k; for k from
`if`(n=0, 0, a(n-1)) do if b(k)>=n then return k fi od
end:
seq(a(n), n=0..120); # Alois P. Heinz, Sep 12 2019
0, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10
1,2
0,3
a(0)=0 prepended by Alois P. Heinz, Sep 12 2019
reviewed
approved