|
| |
|
|
A357313
|
|
a(n) is the unique number m such that A001065(m) = A057709(n).
|
|
4
|
|
|
|
4, 9, 8, 15, 14, 21, 121, 289, 529, 46, 28, 841, 62, 24, 1369, 217, 2209, 106, 68, 3481, 54, 4489, 134, 5041, 66, 6241, 158, 6889, 166, 116, 9409, 10201, 218, 226, 148, 130, 114, 16129, 17161, 18769, 278, 90, 24649, 314, 26569, 27889, 108, 29929, 225, 32041, 244
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
|
|
|
FORMULA
|
|
|
|
EXAMPLE
|
a(1) = 4 since 4 is the unique solution m to A001065(m) = A057709(1) = 3.
|
|
|
MATHEMATICA
|
seq[max_] := Module[{s = t = Table[0, {n, 1, max}], i, j}, Do[If[(i = DivisorSigma[1, n] - n) <= max, s[[i]]++; t[[i]] = n], {n, 2, (max - 1)^2}]; j = Position[s, 1] // Flatten; t[[j]]]; seq[250]
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
