41338

Appears in sequences

• Triangle T(n, k) = Fibonacci(2*k)*T(n-1, k) + Fibonacci(2*(n-k+1))*T(n-1, k-1), with T(n, 1) = T(n, n) = 1, read by rows.at n=46A141688
• Triangle T(n, k) = Fibonacci(2*k)*T(n-1, k) + Fibonacci(2*(n-k+1))*T(n-1, k-1), with T(n, 1) = T(n, n) = 1, read by rows.at n=53A141688
• 1, followed by list of numbers n such that the number of strong primes and the number of weak primes are equal at the n-th prime.at n=29A175102
• Number of ternary strings of length n which contain 01.at n=10A186314
• Diagonal sums of the Riordan matrix (1/(1-3*x^2),x/(1-x)) (A191582).at n=19A191584
• Number of factorizations of m^n into 3 factors, where m is a product of exactly 3 distinct primes and each factor is a product of n primes (counted with multiplicity).at n=36A257464