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.

A377229 Lexicographically earliest sequence of positive integers a(1), a(2), ... such that for any n >= 0, s(n) = Sum_{k=1..n} 1/(F(k)*a(k)) < 1, F = Fibonacci.

This page as a plain text file.
%I A377229 #15 Oct 20 2024 14:14:52
%S A377229 2,3,4,9,44,1486,1357976,1855074754595,2975714380792664939835466,
%T A377229 46528348836004781630107949818181021469921360198769
%N A377229 Lexicographically earliest sequence of positive integers a(1), a(2), ... such that for any n >= 0, s(n) = Sum_{k=1..n} 1/(F(k)*a(k)) < 1, F = Fibonacci.
%H A377229 Alois P. Heinz, <a href="/A377229/b377229.txt">Table of n, a(n) for n = 1..14</a>
%e A377229 s(0), s(1), ... = 0, 1/2, 5/6, 23/24, 215/216, 11879/11880, 17653679/17653680, ... .
%p A377229 F:= combinat[fibonacci]:
%p A377229 s:= proc(n) option remember; `if`(n=0, 0, s(n-1)+1/(F(n)*a(n))) end:
%p A377229 a:= proc(n) option remember; 1+floor(1/((1-s(n-1))*F(n))) end:
%p A377229 seq(a(n), n=1..11);
%Y A377229 Cf. A000045, A079586, A374663, A376058, A377205, A377230.
%K A377229 nonn
%O A377229 1,1
%A A377229 _Alois P. Heinz_, Oct 20 2024