32293

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = (F(2), F(3), F(4), ...).at n=15A025092
• Binomial transform of generalized Jacobsthal numbers A084170.at n=9A084171
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 51", based on the 5-celled von Neumann neighborhood.at n=36A270020
• G.f. A(x) satisfies: A( A(x)^2 ) = C(x) * A(x), where C(x) = x + C(x)^2, with A(0)=0, A'(0)=1.at n=11A272483
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 637", based on the 5-celled von Neumann neighborhood.at n=29A273306
• a(n) = 21*n^2 - 33*n + 13.at n=39A289134