258461

Appears in sequences

• Triangle read by rows giving the coefficients of general sum formulas of n-th Fibonacci numbers (A000045). The k-th row (k>=1) contains T(i,k) for i=1 to 2*k-1, where T(i,k) satisfies F(n) = Sum_{k=1..n} Sum_{i=1..2*k-1} T(i,k) * C(n-k,i-1) * n^(n-k) / (n-1)!.at n=20A100492
• Concatenation of n-th Fibonacci number and n-th prime.at n=17A138821
• Number of multisets of exactly n partitions of positive integers into distinct parts with total sum of parts equal to 2n.at n=24A285230