login
Calculate the aliquot parts of a number n and take their sum. Then repeat the process calculating the aliquot parts of all the previous aliquot parts and add their sum to the previous one. Repeat the process until the sum to be added is zero. Sequence lists these sums.
4

%I #32 Jul 15 2023 06:32:00

%S 0,1,1,4,1,8,1,12,5,10,1,30,1,12,11,32,1,36,1,38,13,16,1,92,7,18,19,

%T 46,1,74,1,80,17,22,15,140,1,24,19,116,1,90,1,62,51,28,1,256,9,62,23,

%U 70,1,136,19,140,25,34,1,286,1,36,61,192,21,122,1,86,29,114

%N Calculate the aliquot parts of a number n and take their sum. Then repeat the process calculating the aliquot parts of all the previous aliquot parts and add their sum to the previous one. Repeat the process until the sum to be added is zero. Sequence lists these sums.

%C a(n) = 1 if n is prime.

%H Amiram Eldar, <a href="/A255242/b255242.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Paolo P. Lava)

%F a(1) = 0.

%F a(2^k) = k*2^(k-1) = A001787(k), for k>=1.

%F a(n^k) = (n^k-2^k))/(n-2), for n odd prime and k>=1.

%F In particular:

%F a(3^k) = A001047(k-1);

%F a(5^k) = A016127(k-1);

%F a(7^k) = A016130(k-1);

%F a(11^k) = A016135(k-1).

%e The aliquot parts of 8 are 1, 2, 4 and their sum is 7.

%e Now, let us calculate the aliquot parts of 1, 2 and 4:

%e 1 => 0; 2 => 1; 4 => 1, 2. Their sum is 0 + 1 + 1 + 2 = 4.

%e Let us calculate the aliquot parts of 1, 1, 2:

%e 1 => 0; 1 = > 0; 2 => 1. Their sum is 1.

%e We have left 1: 1 => 0.

%e Finally, 7 + 4 + 1 = 12. Therefore a(8) = 12.

%p with(numtheory): P:=proc(q) local a,b,c,k,n,t,v;

%p for n from 1 to q do b:=0; a:=sort([op(divisors(n))]); t:=nops(a)-1;

%p while add(a[k],k=1..t)>0 do b:=b+add(a[k],k=1..t); v:=[];

%p for k from 2 to t do c:=sort([op(divisors(a[k]))]); v:=[op(v),op(c[1..nops(c)-1])]; od;

%p a:=v; t:=nops(a); od; print(b); od; end: P(10^3);

%t f[s_] := Flatten[Most[Divisors[#]] & /@ s]; a[n_] := Total@Flatten[FixedPointList[ f, {n}]] - n; Array[a, 100] (* _Amiram Eldar_, Apr 06 2019 *)

%o (PARI) ali(n) = setminus(divisors(n), Set(n));

%o a(n) = my(list = List(), v = [n]); while (#v, my(w = []); for (i=1, #v, my(s=ali(v[i])); for (j=1, #s, w = concat(w, s[j]); listput(list, s[j]));); v = w;); vecsum(Vec(list)); \\ _Michel Marcus_, Jul 15 2023

%Y Cf. A001047, A001065, A001787, A006516, A016127, A016130, A016135, A255243.

%K nonn

%O 1,4

%A _Paolo P. Lava_, Feb 19 2015