Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 May 01 2024 17:02:21
%S 1,6,8,13,14,15,16,17,19,20,21,22,23,25,27,29,31,32,33,35,37,40,41,42,
%T 43,44,45,46,47,49,50,51,53,54,55,57,59,61,62,63,64,65,67,69,71,73,74,
%U 75,76,77,79,81,83,85,87,89,90,91,92,93,95,97,99,100,101,103,104,105
%N Values k such that A001065(x)= k has more than one solution.
%C Numbers k with A048138(k) >= 2. Numbers k which occur in A001065 more than once. Number 1 and numbers k = A160095(n) with A160095(n+1) - A160095(n) = 0.
%e a(3)=8 as the multiplicity of the value 8 is 2: 8 = A001065(10) = A001065(49).
%o (PARI) {z=105; v=vector(z); for(n=1, z^2, a=sigma(n)-n; if(0<a&&a<=z, v[a]++)); for(j=1, z, if(v[j]>1, print1(j, ",")))} \\ _Klaus Brockhaus_, May 26 2009
%Y Cf. A048138, A001065, A160095.
%K nonn
%O 1,2
%A _Jaroslav Krizek_, May 02 2009
%E More terms from _Klaus Brockhaus_, May 26 2009