Antti Karttunen, <a href="/A371733/b371733_1.txt">Table of n, a(n) for n = 1..65537</a>
Antti Karttunen, <a href="/A371733/b371733_1.txt">Table of n, a(n) for n = 1..65537</a>
proposed
approved
editing
proposed
Antti Karttunen, <a href="/A371733/b371733_1.txt">Table of n, a(n) for n = 1..65537</a>
<a href="/index/Pri#prime_indices">Index entries for sequences related to prime indices in the factorization of n</a>.
0, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 2, 1, 5, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 6, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4
(PARI)
A056239(n) = if(1==n, 0, my(f=factor(n)); sum(i=1, #f~, f[i, 2] * primepi(f[i, 1])));
all_have_same_sum_of_pis(facs) = if(!#facs, 1, (#Set(apply(A056239, facs)) == 1));
A371733(n, m=n, facs=List([])) = if(1==n, if(all_have_same_sum_of_pis(facs), #facs, 0), my(s=0, newfacs); fordiv(n, d, if((d>1)&&(d<=m), newfacs = List(facs); listput(newfacs, d); s = max(s, A371733(n/d, d, newfacs)))); (s)); \\ Antti Karttunen, Jan 20 2025
Data section extended to a(108) by Antti Karttunen, Jan 20 2025
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
editing
proposed