27600

Appears in sequences

• 4-dimensional pyramidal numbers: a(n) = n^2*(n^2-1)/12.at n=24A002415
• [ n(n-1)(n-2)(n-3)/11 ].at n=25A011921
• [ n(n-1)(n-2)(n-3)/13 ].at n=26A011923
• a(n) = T(n,[ n/2 ]), where T is the array defined in A026082.at n=15A026094
• Configurations of linear chains in a square lattice.at n=10A033323
• Denominators of continued fraction convergents to sqrt(574).at n=7A042101
• Starting from generation 8 add previous and next term yielding generation 9.at n=27A048455
• Truncated square pyramid numbers: a(n) = Sum_{k = n..2*n-1} k^2.at n=23A050410
• An interleaved sequence of pyramidal and polygonal numbers.at n=46A081283
• a(n) = (2/(n-1))*a(n-1) + ((n+5)/(n-1))*a(n-2) with a(0)=0 and a(1)=1.at n=45A096338
• Structured small rhombicosidodecahedral numbers.at n=11A100148
• Semi-diagonal (one row below central terms) of pendular triangle A118345 and equal to the self-convolution of the central terms (A118346).at n=6A118347
• Convolution triangle, read by rows, where diagonals are successive self-convolutions of A118346.at n=42A118349
• Experience Points thresholds for levels in the pen and paper role-playing game "Das Schwarze Auge" (DSA, a.k.a. "The Dark Eye").at n=23A124437
• Numbers k such that k and k^2 use only the digits 0, 1, 2, 6 and 7.at n=33A136828
• Coefficients of the second order mock theta function B(q).at n=38A153140
• The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 11*n(j) + 1 = a(j)*a(j) and 13*n(j) + 1 = b(j)*b(j); with positive integer numbers.at n=2A159665
• Triangle read by rows, A095989 convolved with A000670.at n=40A163204
• Number of ways to place 3 nonattacking amazons (superqueens) on an n X n toroidal board.at n=9A178973
• Triangle read by rows: T(n,k) = number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to k.at n=48A180281