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 A084303 #13 Mar 25 2017 20:28:38
%S A084303 5,1,7,2,3,2401
%N A084303 Smallest x such that sigma(x) mod 6 = n.
%C A084303 Row 6 of A074625 (apart from different ordering). - _Michel Marcus_, Dec 19 2013
%e A084303 n=5: sigma(2401) = 1+7+49+343+2401 = 2801 = 6*466+5, hence a(5)=2401.
%t A084303 Table[k = 1; While[Mod[DivisorSigma[1, k], 6] != n, k++]; k, {n, 0, 5}] (* _Michael De Vlieger_, Mar 25 2017 *)
%o A084303 (PARI) a(n) = {my(x = 1); while((sigma(x) % 6) != n, x++); x;} \\ _Michel Marcus_, Dec 18 2013
%Y A084303 Cf. A000203, A074384.
%K A084303 easy,fini,full,nonn
%O A084303 0,1
%A A084303 _Labos Elemer_, Jun 02 2003