24306

Appears in sequences

• a(0) = 1, a(n) = 31*n^2 + 2 for n>0.at n=28A010020
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A000201 (lower Wythoff sequence).at n=25A024593
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A000201 (lower Wythoff sequence).at n=24A025107
• LAH transform of squares.at n=6A103194
• a(n) = (5*n^3+12*n^2+n+6)/6.at n=30A114211
• a(n) = (a(n-1)*a(n-3)^3+a(n-2))/a(n-4) with a(0)=a(1)=a(2)=a(3)=1.at n=9A208223
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 411", based on the 5-celled von Neumann neighborhood.at n=32A271891
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = Sum_{j=0..n} j^k * (n-j)! * binomial(n,j)^2.at n=34A341200
• Number of edges in a hexagon when n internal hexagons are drawn between the 6n points that divide each side into n+1 equal parts.at n=45A357198