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.

A229210 Numbers k such that Sum_{i=1..k} (i-tau(i))^i == 0 (mod k), where tau(i) = A000005(i), the number of divisors of i, and i-tau(i) = A049820(i).

This page as a plain text file.
%I A229210 #23 Feb 14 2021 16:26:47
%S A229210 1,2,5,24,36,371,445,1578,3616,9292,38123,142815,184097
%N A229210 Numbers k such that Sum_{i=1..k} (i-tau(i))^i == 0 (mod k), where tau(i) = A000005(i), the number of divisors of i, and i-tau(i) = A049820(i).
%C A229210 a(12) > 50000.
%C A229210 a(14) > 200000. - _Michel Marcus_, Feb 25 2016
%e A229210 (1 - tau(1))^1 + (2 - tau(2))^2 + ... + (5 - tau(5))^5 = 245 and 245 / 5 = 49.
%p A229210 with(numtheory); P:=proc(q) local n, t; t:=0;
%p A229210 for n from 1 to q do t:=t+(n-tau(n))^n; if t mod n=0 then print(n);
%p A229210 fi; od; end: P(10^6);
%o A229210 (PARI) isok(n) = sum(i=1, n, Mod(i-numdiv(i), n)^i) == 0; \\ _Michel Marcus_, Feb 25 2016
%Y A229210 Cf. A000010, A227427, A227429, A227502, A227848, A229095, A229207-A229209, A229211.
%K A229210 nonn,more
%O A229210 1,2
%A A229210 _Paolo P. Lava_, Sep 16 2013
%E A229210 Name corrected by _Michel Marcus_, Feb 25 2016
%E A229210 a(12)-a(13) from _Michel Marcus_, Feb 25 2016