18297

Appears in sequences

• a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (odd natural numbers).at n=37A024598
• a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor(n/2), s = (odd natural numbers).at n=36A025112
• Coefficient triangle of polynomials (falling powers) related to convolutions of A001045(n+1), n >= 0, (generalized (1,2)-Fibonacci). Companion triangle is A073399.at n=8A073400
• Coefficient triangle of polynomials (rising powers) related to convolutions of A001045(n+1), n >= 0, (generalized (1,2)-Fibonacci). Companion triangle is A073401.at n=7A073402
• Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.at n=24A084276
• a(n) = (5/6)*n^3+(5/2)*n^2+(8/3)*n.at n=27A092185
• a(n) = n*(8*n^2 + 1)/3.at n=19A143166
• a(n) = n*(n+1)*(2*n+1)/6 - n*floor(n/2).at n=37A178946
• Number of length n 1..(2+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7.at n=12A258625
• Row sums of A285118: a(n) = Sum_{k=1..(n-1)} (C(n-1,k-1) bitwise-and C(n-1,k)), a(0) = a(1) = 0.at n=16A285115
• a(0) = 1; a(n) = 5 * Sum_{k=0..n} k * binomial(4*n+k,n-k)/(4*n+k).at n=6A390714
• Number of vertices in a complete bipartite graph where the vertices in the two parts are placed on opposite sides of a parabola at integer y coordinates y = 1, 2, ...n.at n=16A392442