20631

Appears in sequences

• a(n) = (2*n - 7)*n^2.at n=23A015242
• Convolution of natural numbers >= 2 and natural numbers >= 3.at n=45A023545
• a(n) = floor(exp(Pi*sqrt(n))).at n=10A060456
• Define a pair of sequences by p(0) = 0, q(0) = p(1) = q(1) = 1, q(n+1) = p(n)*q(n-1), p(n+1) = q(n+1) + q(n) for n > 0; then a(n) = q(n) and A064526(n) = p(n).at n=8A064183
• The Berndt-type sequences number 7 for the argument 2*Pi/13.at n=5A217548
• Number of (n+1)X(n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=3A250805
• Number of (n+1) X (4+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=3A250808
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=24A250812
• Number of (4+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=3A250816
• Numbers D such that D^2 = A^3 + B^4 + C^5 has more than one solution in positive integers (A, B, C).at n=13A256603
• Number of reducible integer partitions of n.at n=36A305563