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 A076496 #48 Feb 05 2023 08:15:10 %S A076496 1,6,11,24,30,42,54,66,78,102,114,121,138,174,186,222,246,258,282,304, %T A076496 318,354,366,402,426,438,474,498,534,582,606,618,642,654,678,762,780, %U A076496 786,822,834,894,906,942,978,1002,1038,1074,1086,1146,1158,1182,1194,1266,1338 %N A076496 Numbers k such that sigma(k) == 12 (mod k). %H A076496 Vincenzo Librandi, <a href="/A076496/b076496.txt">Table of n, a(n) for n = 1..1000</a>, corrected by _Sidney Cadot_, Feb 05 2023 %e A076496 6*p is a solution if p > 3 is prime, since sigma(6*p) = 1 + 2 + 3 + 6 + p + 2*p + 3*p + 6*p = 12*(p+1) = 2*6*p + 12 = 2*k + 12. These are "regular" solutions. Also k = 121, 304 are "singular" solutions. See other remainders in cross-references. %t A076496 Select[Range[2000], Mod[DivisorSigma[1, #] - 12, #] == 0 &] (* _Vincenzo Librandi_, Mar 11 2014, corrected by _Amiram Eldar_, Jan 04 2023 *) %o A076496 (PARI) isok(k) = Mod(sigma(k), k) == 12; \\ _Michel Marcus_, Jan 04 2023 %Y A076496 Cf. A054024, A045768, A045769, A045770, A076495, A088834. %Y A076496 Cf. A141545 (a subsequence). %K A076496 nonn %O A076496 1,2 %A A076496 _Labos Elemer_, Oct 21 2002 %E A076496 Initial term 1 added by _Vincenzo Librandi_, Mar 11 2014 %E A076496 Terms 6 and 11 inserted by _Michel Marcus_, Jan 04 2023