|
|
A290469
|
|
Numbers x such that x = Sum_{i=1..k} (x mod d_(x+i)) for some k, where d_(x+i) is the aliquot parts of (x+i).
|
|
2
|
|
|
5, 10, 11, 14, 30, 145, 195, 367, 375, 471, 1695, 2523, 9807, 21249, 30847, 437744, 2075647, 2346495, 8341503, 14223687, 33452031, 15085100835
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Values of k for the listed terms are 3, 4, 1, 2, 3, 2, 1, 1, 2, 2, 1, 2, 2, 2, 1, 1, 1, 2.
|
|
LINKS
|
|
|
EXAMPLE
|
For 5 the value of k is 3. Aliquot parts of 6, 7 and 8 are: [1, 2, 3], [1], [1, 2, 4]. Residues are 0 + 1 + 2 + 0 + 0 + 1 + 1 that sum up to 5.
|
|
MAPLE
|
with(numtheory): P:=proc(q) local a, b, j, k, n; for n from 3 to q do
a:=0; k:=0; while a<n do k:=k+1; b:=sort([op(divisors(n+k))]);
a:=a+add(n mod b[j], j=1..nops(b)-1); od;
if a=n then print(n); fi; od; end: P(10^9);
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|