A376058 Lexicographically earliest sequence of positive integers a(0), a(1), a(2), a(3), ... such that for any n > 0, S(n) = Sum_{k = 0..n-1} Fibonacci(k)/a(k) < 1.

1, 2, 3, 13, 235, 91651, 13439702641, 293516611480726842391, 139168617347514378219313352146196398680331, 31357558945249615124049146384908197437748687514518843725326663348294514909787525421

Offset: 0

Author

N. J. A. Sloane, Sep 14 2024

Keywords

• nonn
• base

Crossrefs

Cf. A000045, A374663, A375516, A375531, A375532, A375781, A375522, A376048-A376057, A376059

Formula

a(n+1) = Fibonacci(n+1)*A376059(n) + 1.