The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A071865 Smallest k such that the simple continued fraction for Sum(d|k, 1/d) contains exactly n elements. 0
 1, 2, 4, 14, 22, 26, 75, 195, 330, 324, 935, 1598, 3422, 3663, 10191, 14066, 12099, 53661, 121555, 182169, 235509, 307615, 633945, 2097595, 2072198, 2643298, 6544282, 8675343, 13670722, 17573794, 85112326, 77295778, 235873898, 362150458, 544042486, 1457255474 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE sum(d|195, 1/d) = 112/65 and 112/65 continued fraction is [1, 1, 2, 1, 1, 1, 1, 3] which contains 8 elements. There is no smaller number than 195 with this property hence a(8)=195. MATHEMATICA a = Table[0, {50}]; Do[b = Length[ ContinuedFraction[ Apply[ Plus, 1/Divisors[n]]]]; If[ a[[b]] == 0, a[[b]] = n], {n, 1, 10^7}] PROG (PARI) for(n=1, 21, s=1; while(length(contfrac(sumdiv(s, d, 1/d)))

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

Last modified September 18 04:14 EDT 2020. Contains 337165 sequences. (Running on oeis4.)