534978

Appears in sequences

• Row sums of the inverse of number triangle A(n,k) = 1/C(n) if k <= n <= 2k, 0 otherwise, where C(n) = A000108(n).at n=13A127768
• a(n) = A127768(2n+1). A bisection of the row sums of the inverse of number triangle A(n,k) = 1/C(n) if k <= n <= 2k, 0 otherwise, where C(n) = A000108(n).at n=6A127770
• Number of ways to write n as an ordered sum of nine positive Fibonacci numbers (with a single type of 1).at n=38A357717