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.

A227611 Number of ways 2/n can be expressed as the sum of three distinct unit fractions: 2/n = 1/x + 1/y + 1/z with 0 < x < y < z.

This page as a plain text file.
%I A227611 #12 Sep 08 2021 01:12:10
%S A227611 0,1,5,6,9,15,14,22,21,30,22,45,17,36,72,62,22,69,29,84,77,56,39,142,
%T A227611 48,53,82,124,30,178,34,118,94,67,176,191,29,74,151,274,37,227,37,145,
%U A227611 220,87,57,342,80,146,138,162,39,216,214,322,134,100,73,461,31,84,316,257,197,304,47,199,166,435,69,508,34,79,317
%N A227611 Number of ways 2/n can be expressed as the sum of three distinct unit fractions: 2/n = 1/x + 1/y + 1/z with 0 < x < y < z.
%C A227611 See A073101 for the 4/n conjecture due to Erdős and Straus.
%t A227611 f[n_] := Length@ Solve[2/n == 1/x + 1/y + 1/z && 0 < x < y < z, {x, y, z}, Integers]; Array[f, 75]
%Y A227611 Cf. A002966, A073546.
%Y A227611 Cf. A227610 (1/n), A075785 (3/n), A073101 (4/n), A075248 (5/n), A227612.
%K A227611 nonn
%O A227611 1,3
%A A227611 _Robert G. Wilson v_, Jul 17 2013