41455

Appears in sequences

• Second-order Fibonacci numbers.at n=20A010049
• Form a triangle with n numbers in top row; all other numbers are the sum of their parents. E.g.: 4 1 2 7; 5 3 9; 8 12; 20. The numbers must be positive and distinct and the final number is to be minimized. Sequence gives final number.at n=13A028307
• Column k=8 sequence of array A103728.at n=3A103735
• Column k=10 sequence of array A103728.at n=3A103915
• Number of n X n arrays of squares of integers with every 3X3 subblock summing to 4.at n=4A159201
• G.f. A(x) satisfies: Sum_{k=0..n} [x^k] A(x)^n = binomial(6*n,3*n).at n=4A244652
• Number of length 4 0..n arrays with each partial sum starting from the beginning no more than sqrt(3) standard deviations from its mean.at n=13A244943
• Number of factorizations of m^n into exactly six factors, where m is a product of two distinct primes.at n=11A277242
• Number of subwords of the form DUUD or DDUUD in nondecreasing Dyck paths of length 2n.at n=12A377866