252000

Appears in sequences

• The number of permutations of n cards in which 4 will be the next hit after 2.at n=7A018932
• Theta series of lattice D3 tensor D3* (dimension 9, det. 262144, min. norm 6).at n=35A033694
• Triangle of coefficients of certain polynomials (exponents in decreasing order).at n=50A033842
• Triangle read by rows: T(n,k) = k!*binomial(n-1,k-1)*Stirling2(n,k), 1 <= k <= n.at n=25A048743
• Triangle of coefficients of certain polynomials (exponents in increasing order), equivalent to A033842.at n=49A049323
• Expansion of e.g.f. (1-x^2)/(1-x-2*x^2+x^4).at n=7A052685
• a(n) = 9*(n-2)*(5*n-13)*(5*n^2 - 19*n + 16)/2.at n=7A060786
• Duplicate of A060786.at n=7A064196
• a(n) = A062401(A065391(n)): phi(sigma(m)) peak values for numbers m (listed in A065391) at which those peaks are first reached.at n=37A065392
• Let M_k be the k X k matrix M_k(i,j)=1/binomial(i+n,j); then a(n)=1/det(M_(n+1)).at n=3A069945
• Product of terms of continued fraction expansion of (3/2)^n.at n=18A071337
• Number of connectedness systems on n vertices that contain all singletons and the set of all the vertices.at n=4A072447
• a(n) = (n+1)*(2*n+1)*(4*n+1).at n=31A079588
• a(n) = (n^2 + 1)*n!.at n=7A082042
• Triangle T(n,k) read by rows, where T(n,k) = number of times the permanent of a real nonsingular n X n (0,1)-matrix takes the value k, for n >= 1, 1 <= k <= A000255(n).at n=23A089480
• Triangle read by rows: T(n,k) is the number of permutations p of [n] in which the length of the longest initial segment avoiding both the 132- and the 321-pattern is equal to k.at n=49A092741
• Structured icosidodecahedral numbers.at n=31A100147
• Triangle: let f(t) = 1 + t + t^2 and g(t) = t + t^2, expansion of p(t) = f(t)*exp(x*g(t)).at n=61A137391
• a(n)=2a(n-1) but when sum of digits of 2a(n-1) is greater than 9 take a(n) = largest number < 2a(n-1) which has sum of digits = 9.at n=18A140134
• Wiener index of the grid P_n x P_n, where P_n is the path graph on n vertices.at n=14A143945