|
|
A348625
|
|
Number of Egyptian fractions with squared denominators: number of solutions of 1 = 1/x_1^2 + ... + 1/x_n^2 where 0 < x_1 <= ... <= x_n.
|
|
4
|
|
|
1, 0, 0, 1, 0, 1, 1, 4, 7, 47, 186, 1809, 27883
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
COMMENTS
|
All denominators are bounded by A348626(n), i.e., 0 < x_1 <= ... <= x_n < A348626(n). Furthermore, for a fixed n, x_i <= sqrt(n+1-i)*(A348626(i)-1).
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|