cp's OEIS Frontend

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.

A341437 Numbers k such that k divides Sum_{j=0..k} j^(k-j).

This page as a plain text file.
%I A341437 #29 Feb 15 2021 10:39:27
%S A341437 1,2,6,7,9,42,46,431,1806,2506,11318,16965,25426,33146,33361,37053,
%T A341437 49365,99221,224506,359703,436994
%N A341437 Numbers k such that k divides Sum_{j=0..k} j^(k-j).
%C A341437 Numbers k such that k divides A026898(k-1).
%C A341437 a(19) > 10^5.
%F A341437 0^6 + 1^5 + 2^4 + 3^3 + 4^2 + 5^1 + 6^0 = 66 = 6 * 11. So 6 is a term.
%t A341437 Do[If[Mod[Sum[PowerMod[k, n - k, n], {k, 0, n}], n] == 0, Print[n]], {n, 1, 3000}] (* _Vaclav Kotesovec_, Feb 12 2021 *)
%o A341437 (PARI) isok(n) = sum(k=0, n, Mod(k, n)^(n-k))==0;
%Y A341437 Cf. A026898, A128981, A188775, A341436.
%K A341437 nonn,more
%O A341437 1,2
%A A341437 _Seiichi Manyama_, Feb 11 2021
%E A341437 a(19) from _Vaclav Kotesovec_, Feb 14 2021
%E A341437 a(20)-a(21) from _Chai Wah Wu_, Feb 15 2021