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 A063519 #7 Apr 30 2023 23:16:16
%S A063519 65,95,341,95,161,115,629,203,145,203,365,155,185,155,301,185,329,235,
%T A063519 1541,287,185,287,413,205,329,215,469,215,905,371,365,305,553,371,
%U A063519 1037,235,1145,623,445,371,35249,295,1133,371,497,515,749,413,305,671,565
%N A063519 Least composite k such that phi(k+12n) = phi(k)+12n and sigma(k+12n) = sigma(k) + 12n where phi is the Euler totient function and sigma is the sum of divisors function.
%C A063519 No such simultaneous solutions were found if d=12n+6.
%F A063519 a(n) = Min{k: phi(k+12n) = phi(k)+12n and sigma(k+12n) = sigma(k)+12n and k is composite} with phi(k) = A000010(k) and sigma(k) = A000203(k).
%e A063519 a(97)=10217 because 10217 is composite, phi(10217)+1164 = 9600+1164 = 10764 = phi(11381) and sigma(10217)+1164 = 10836+1164 = 12000 = sigma(11381) with 1164 = 12*97 and there is no smaller composite with these properties.
%Y A063519 A000010, A000203, A054904, A054905, A055458.
%K A063519 nonn
%O A063519 1,1
%A A063519 _Labos Elemer_, Aug 01 2001
%E A063519 Name corrected by _Sean A. Irvine_, Apr 30 2023