41184

Appears in sequences

• Coordination sequence for diamond structure D^+_6. (Edges defined by l_1 norm = 1.)at n=11A035879
• Numbers that have exactly nine prime factors counted with multiplicity (A046312) whose digit reversal is different and also has 9 prime factors (with multiplicity).at n=4A109029
• Riordan array (1/(1-2x),x/(1-2x)^2).at n=49A114192
• Determinants of 5 X 5 matrices consisting of 25 consecutive primes.at n=11A118815
• If X_1,...,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 5-subsets of X containing none of X_i, (i=1,...n).at n=8A130811
• a(n) = binomial(n+8,8) * 2^n.at n=5A140325
• a(n) = A143176(n)/n.at n=34A143177
• Triangular array of generalized Narayana numbers: T(n, k) = 4*binomial(n+1, k+3)*binomial(n+1, k-1)/(n+1).at n=47A145598
• Total number of possible knight moves on an n X n X n chessboard, if the knight is placed anywhere.at n=11A180413
• Numbers with prime factorization pqr^2s^5.at n=16A190293
• Triangle of coefficients of polynomials v(n,x) jointly generated with A208753; see the Formula section.at n=52A208754
• 8-quantum transitions in systems of N >= 8 spin 1/2 particles, in columns by combination indices.at n=9A213350
• Area A of the cyclic quadrilaterals PQRS with PQ>=QR>=RS>=SP, such that A, the sides, the radius of the circumcircle and the two diagonals are integers.at n=59A219225
• Number of set partitions of {1,...,n} with largest set of size 7.at n=5A229249
• Triangle read by rows: T(n,k) = number of colored weighted Motzkin paths ending at (n,k).at n=22A293172
• Number of 6-cycles in the n-polygon diagonal intersection graph.at n=30A300554
• a(n) = 27*n^2 - 51*n + 24, n>=1.at n=39A304836
• a(n) = sigma(2*n) * binomial(2*n,n)/2, for n >= 1.at n=6A322185
• Table read by ascending antidiagonals: T(n, k) is the maximum number of quasi k-gons that are not k-gons in a finite projective plane of order n, with k >= 3.at n=4A342307
• a(n) = n*(1 - (-1)^n - 2*(3 + (-1)^n)*n^2 + 2*n^4)/384.at n=24A350689