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.

A157248 'Greedy' sequence formed by summing unit fractions until the sum is 1, and repeating using up the 'left over' fractions.

This page as a plain text file.
%I A157248 #16 Jul 25 2024 14:08:30
%S A157248 1,2,3,6,4,5,7,8,9,10,15,230,57960,11,12,13,14,16,17,18,19,20,21,22,
%T A157248 23,24,25,26,27,28,29,30,1544,8242614,92401258430373,
%U A157248 36895712779713620978746324067
%N A157248 'Greedy' sequence formed by summing unit fractions until the sum is 1, and repeating using up the 'left over' fractions.
%C A157248 Subsequence of starting elements of each pass may be related to A002387 1,2,4,11,31,83,... - _David W. Wilson_
%D A157248 H. Ibstedt, Computer Analysis of Number Sequences, American Research Press, 1998; Chapter VI.2 Integers represented as sums of terms of the harmonic series.
%H A157248 Jeremy Gardiner, <a href="/A157248/b157248.txt">Table of n, a(n) for n=1..94</a>
%H A157248 K. S. Brown's Mathpages, <a href="http://www.mathpages.com/home/kmath454.htm">The Greedy Algorithm for Unit Fractions</a>
%e A157248 1/2+1/3+1/6=1
%o A157248 (PARI) {r=1;u=[];l=1;for(n=1,99,while(setsearch(u,l),l++);m=ceil(1/r);while(setsearch(u,m),m++);print1(m",");r-=1/m;r||r=1;u=setunion(u,Set(m)))} \\ _M. F. Hasler_
%Y A157248 Cf. A192881.
%K A157248 nonn
%O A157248 1,2
%A A157248 _Jeremy Gardiner_, Feb 25 2009