This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A069165 #19 Apr 29 2025 04:44:39
%S A069165 1,3,33,55,75,77,121,125,121,143,175,187,275,209,274,275,253,325,319,
%T A069165 341,425,407,475,588,451,473,575,517,583,725,649,1233,671,775,737,781,
%U A069165 803,925,869,1025,913,1075,979,1175,1067,1111,1133,1325,1177,2055,1199
%N A069165 a(n) are the integers corresponding to A069164(n).
%C A069165 The previous name was "Integers of the form k * Sum_{d|k} 1/tau(d)", but this did not take into account the occurrence of multiple terms and the non-ascending order.
%H A069165 Amiram Eldar, <a href="/A069165/b069165.txt">Table of n, a(n) for n = 1..10000</a>
%F A069165 a(n) = f(A069164(n)), where f(n) = n*A265391(n)/A265392(n). - _Amiram Eldar_, Apr 29 2025
%t A069165 Select[Table[n * DivisorSum[n, 1/DivisorSigma[0, #] &], {n, 1, 500}], IntegerQ] (* _Amiram Eldar_, Apr 29 2025 *)
%Y A069165 Cf. A000005, A069164, A265391, A265392.
%K A069165 easy,nonn
%O A069165 1,2
%A A069165 _Benoit Cloitre_, Apr 09 2002
%E A069165 Name corrected by _Hugo Pfoertner_, Jul 07 2024