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!)
A354742 a(1)=1, a(n) is the smallest number > a(n-1) such that the simple continued fraction for 1/a(1) + 1/a(2) + ... + 1/a(n) contains exactly n elements. 2
1, 2, 3, 11, 16, 21, 27, 35, 42, 51, 55, 63, 75, 89, 350, 364, 385, 536, 644, 707, 4290, 10483, 13818, 2923344, 3187100, 7820430, 31734729, 39111981 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
seq[len_] := Module[{s = {}, sum = 0, t = 0}, Do[t++; While[Length[ContinuedFraction[sum + 1/t]] != n, t++]; sum += 1/t; AppendTo[s, t], {n, 1, len}]; s]; seq[23]
PROG
(PARI) s=0; t=0; for(n=1, 40, t++; while(length(contfrac(s+1/t)) != n, t++); s+=1/t; print1(t, ", "))
CROSSREFS
Sequence in context: A194558 A076514 A071012 * A228520 A361127 A280969
KEYWORD
nonn,more
AUTHOR
Amiram Eldar, Jun 05 2022
STATUS
approved

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 July 24 04:30 EDT 2024. Contains 374575 sequences. (Running on oeis4.)