cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A241883 Number of ways 1/n can be expressed as the sum of four distinct unit fractions: 1/n = 1/w + 1/x + 1/y + 1/z satisfying 0 < w < x < y < z.

This page as a plain text file.
%I A241883 #18 Sep 08 2021 00:58:04
%S A241883 6,71,272,586,978,1591,1865,3115,3772,4964,4225,8433,4987,10667,13659,
%T A241883 10845,7513,17360,9569,28554,23309,17220,12326,37554,19984,24091,
%U A241883 31056,42343,16095,57001,15076,42655,46885,38416,77887,71959,16692,42054,68894,95914,24566,100023,24224,99437,108756,41907,29711,127069,52811,94745,83433
%N A241883 Number of ways 1/n can be expressed as the sum of four distinct unit fractions: 1/n = 1/w + 1/x + 1/y + 1/z satisfying 0 < w < x < y < z.
%H A241883 Jud McCranie, <a href="/A241883/b241883.txt">Table of n, a(n) for n = 1..644</a>
%e A241883 1/1 = 1/2 + 1/3 + 1/7  + 1/42
%e A241883     = 1/2 + 1/3 + 1/8  + 1/24
%e A241883     = 1/2 + 1/3 + 1/9  + 1/18
%e A241883     = 1/2 + 1/3 + 1/10 + 1/15
%e A241883     = 1/2 + 1/4 + 1/5  + 1/20
%e A241883     = 1/2 + 1/4 + 1/6  + 1/12
%e A241883 so a(1) = 6.
%t A241883 a[n_] := Length@ Solve[1/n == 1/w + 1/x + 1/y + 1/z && 0 < w < x < y < z, {w, x, y, z}, Integers]; Array[f, 21]
%Y A241883 Cf. A002966, A004194, A020327, A227610.
%K A241883 nonn
%O A241883 1,1
%A A241883 _Robert G. Wilson v_, Apr 30 2014