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.

A339627 Number of partitions of n into distinct parts such that the sum of reciprocals of parts is an integer.

This page as a plain text file.
%I A339627 #7 Dec 10 2020 16:46:56
%S A339627 1,1,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,1,2,2,1,
%T A339627 0,0,0,1,2,1,0,0,0,1,1,2,2,0,0,0,2,2,1,2,2,2,1,2,2,1,2,2,3,2,4,5,4,7,
%U A339627 4,2,2,6,6,1,3,3,4,3,4
%N A339627 Number of partitions of n into distinct parts such that the sum of reciprocals of parts is an integer.
%C A339627 Also the number of ways to express an integer as the sum of distinct unit fractions such that the sum of the denominators is n.
%H A339627 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%H A339627 <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>
%e A339627 a(31) = 2 because we have 2 + 4 + 5 + 20 = 1 + 2 + 3 + 10 + 15 = 31 and 1/2 + 1/4 + 1/5 + 1/20 = 1, 1/1 + 1/2 + 1/3 + 1/10 + 1/15 = 2 are integers.
%Y A339627 Cf. A051907, A051908, A058360, A339628, A339629.
%K A339627 nonn
%O A339627 0,32
%A A339627 _Ilya Gutkovskiy_, Dec 10 2020