login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 4
1, 2, 5, 24, 36, 371, 445, 1578, 3616, 9292, 38123, 142815, 184097 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(12) > 50000.
a(14) > 200000. - Michel Marcus, Feb 25 2016
LINKS
EXAMPLE
(1 - tau(1))^1 + (2 - tau(2))^2 + ... + (5 - tau(5))^5 = 245 and 245 / 5 = 49.
MAPLE
with(numtheory); P:=proc(q) local n, t; t:=0;
for n from 1 to q do t:=t+(n-tau(n))^n; if t mod n=0 then print(n);
fi; od; end: P(10^6);
PROG
(PARI) isok(n) = sum(i=1, n, Mod(i-numdiv(i), n)^i) == 0; \\ Michel Marcus, Feb 25 2016
CROSSREFS
Sequence in context: A137094 A209866 A130379 * A047147 A111047 A068964
KEYWORD
nonn,more
AUTHOR
Paolo P. Lava, Sep 16 2013
EXTENSIONS
Name corrected by Michel Marcus, Feb 25 2016
a(12)-a(13) from Michel Marcus, Feb 25 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)