|
|
A130698
|
|
Numbers n such that the sum of the sum-of-divisors function of all integers up to n is a square.
|
|
2
|
|
|
1, 2, 53, 174, 299, 1377, 12695, 44469, 423922, 2068248, 12084331, 46270468, 1330157705, 5319721272, 144083207084, 178358383042, 212557463865, 2125965021380, 6323865789846, 7277308988873
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
It is not known if this sequence is infinite.
The standard heuristic suggests this sequence is infinite with logarithmic density. - Charles R Greathouse IV, Feb 04 2013
|
|
LINKS
|
|
|
FORMULA
|
n such that sigma(1)+sigma(2)+...+sigma(n) = x^2 with some integer x.
|
|
EXAMPLE
|
a(2) = 2 since sigma(1) = 1^2 and sigma(1)+sigma(2) = 2^2.
|
|
MATHEMATICA
|
L=0; For[j = 1, j < 1000000, j++, L = L + DivisorSigma[1, j]; If[L == Floor[Sqrt[L]]^2, Print[j, " ", Floor[Sqrt[L]]]]]
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Florian Luca (fluca(AT)matmor.unam.mx), Jul 11 2007
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|