52390

Appears in sequences

• Third column of triangle A054453.at n=17A054454
• Convolution of Fibonacci F(n+1), n >= 0, with F(n+3), n >= 0.at n=16A067331
• a(0)=1; a(1)=2; a(n+1) = 2*n*a(n) - a(n-1) for n >= 1.at n=7A093856
• a(n) = a(n-1) + a(n-2) + F(n), with a(0) = 0, a(1) = 1, a(2) = a(1) + a(0), a(3) = a(2) + a(1), a(4) = a(3) + a(2) + 2.at n=19A166106
• Consider the partitions of n in reverse lexicographic ordering (A080577), a(n) is the position of the partition of n which has the maximum LCM. See A000793.at n=46A213952
• Number of (n+2)X(5+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001111.at n=7A260367
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 931", based on the 5-celled von Neumann neighborhood.at n=33A273790
• Triangle read by rows. T(n,k) is the number of invertible n X n matrices over GF(2) such that the dimension of the eigenspace corresponding to eigenvalue 1 is k, 0 <= k <= n, n >= 0.at n=18A346381
• Numbers k such that sigma(k) = psi(k) + tau(k)^2.at n=42A390296