|
%I #26 Jul 27 2015 17:41:15
%S 1,2,3,5,6,13,14,24,34,60,61,168,169,252,627,1011,1012,2430,2431,7212,
%T 15024,16553,16554,50219,60008,64284,92071,260178,260179,844846,
%U 844847,1431187,2608883,2661217,7946814,22692855,22692856,22911815
%N Egyptian fractions: number of partitions of 1 into reciprocals of positive integers <= n.
%C Number of ways to represent 1 = Sum_{k=1..n} b(k)/k, where the b(k) >= 0. - _Franklin T. Adams-Watters_, Aug 01 2006
%H Toshitaka Suzuki, <a href="/A020473/b020473.txt">Table of n, a(n) for n = 1..390</a>
%H <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>
%F a(n) = Sum(A092666(i), i=1..n).
%F For prime p, a(p) = a(p-1) + 1. - _Max Alekseyev_, May 07 2012
%t Timing[Table[Length[IntegerPartitions[1, All, 1/Range[n]]], {n, 1, 20}]] (* _Ben Branman_, Apr 21 2012 *)
%Y Cf. A038034, A092670, A208480.
%K nonn
%O 1,2
%A _David W. Wilson_
|
