login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A306349 Number of terms in the greedy Egyptian fraction representation of n. 3

%I #24 Feb 15 2019 03:09:19

%S 1,4,13,35,99

%N Number of terms in the greedy Egyptian fraction representation of n.

%C a(n) >= A004080(n).

%C a(6) > 255 and the denominator of the 255th term in the representation of 6 has 1264021241 digits.

%H <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>

%e a(3)=13 is the number of terms of A140335;

%e a(4)=35 is the number of terms of A281873.

%o (Python)

%o from sympy.ntheory import egyptian_fraction

%o def A306349(n): return len(egyptian_fraction(n))

%Y Cf. A004080, A140335, A281873.

%K nonn,more

%O 1,2

%A _Pontus von Brömssen_, Feb 09 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)