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 A226967 #20 Sep 06 2018 10:12:13
%S A226967 1,2,3,9,54,378,16254
%N A226967 Numbers n such that 1^n + 2^n + 3^n + ... + n^n == 9 (mod n).
%C A226967 Also, numbers n such that B(n)*n == 9 (mod n), where B(n) is the n-th Bernoulli number. Equivalently, SUM[prime p, (p-1) divides n] n/p == -9 (mod n). There are no other terms below 10^30. - _Max Alekseyev_, Aug 26 2013
%t A226967 Select[Range[10000], Mod[Sum[PowerMod[i, #, #], {i, #}], #] == Mod[9,#] &]
%o A226967 (PARI) is(n)=Mod(sumdiv(n, d, if(isprime(d+1), n/(d+1))), n)==-9 \\ _Charles R Greathouse IV_, Nov 13 2013
%Y A226967 Cf. A031971.
%Y A226967 Solutions to 1^n+2^n+...+n^n == m (mod n): A005408 (m=0), A014117 (m=1), A226960 (m=2), A226961 (m=3), A226962(m=4), A226963 (m=5), A226964 (m=6), A226965 (m=7), A226966 (m=8), this sequence (m=9), A280041 (m=19), A280043 (m=43), A302343 (m=79), A302344 (m=193).
%K A226967 nonn,more
%O A226967 1,2
%A A226967 _José María Grau Ribas_, Jun 24 2013
%E A226967 1,2,9 prepended by _Max Alekseyev_, Aug 26 2013