cp's OEIS Frontend

A346377 a(n) is the number of solutions k to A075254(k) = n.

%I A346377 #10 Jul 15 2021 18:54:22
%S A346377 1,0,0,1,0,1,0,1,0,1,1,0,0,2,1,0,1,0,1,0,0,1,2,1,0,2,0,0,1,0,1,0,1,1,
%T A346377 2,1,0,1,1,1,1,1,0,0,0,2,2,0,0,0,1,0,1,1,1,1,0,1,3,0,0,2,1,0,1,0,0,0,
%U A346377 2,0,3,1,0,1,0,2,0,0,1,0,0,2,1,2,0,1,0,1,2,0,0,0,2,1,3,1,0,1,1
%N A346377 a(n) is the number of solutions k to A075254(k) = n.
%C A346377 a(n) is the number of k such that k + A001414(k) = n.
%H A346377 Robert Israel, <a href="/A346377/b346377.txt">Table of n, a(n) for n = 1..10000</a>
%e A346377 a(14) = 2 because there are two solutions to A075254(k) = 14, namely
%e A346377 A075254(7) = 7+7 = 14
%e A346377 A075254(8) = 8+2+2+2 = 14
%p A346377 f:= proc(n) local t; add(t[1]*t[2],t=ifactors(n)[2])+n end proc:
%p A346377 N:= 100: # for a(1)..a(N)
%p A346377 V:= Vector(N):
%p A346377 for n from 1 to N do
%p A346377   v:= f(n);
%p A346377   if v <= N then V[v]:= V[v]+1 fi
%p A346377 od:
%p A346377 convert(V[1..N],list);
%t A346377 f[1] = 1; f[n_] := n + Plus @@ Times @@@ FactorInteger[n]; m = 100; v = Table[0, {m}]; Do[i = f[n]; If[i <= m, v[[i]]++], {n, 1, m}]; v (* _Amiram Eldar_, Jul 14 2021 *)
%Y A346377 Cf. A001414, A075254, A346378.
%K A346377 nonn
%O A346377 1,14
%A A346377 _J. M. Bergot_ and _Robert Israel_, Jul 14 2021