29172

Appears in sequences

• Decimal part of a(n)^(1/2) starts with a 'nine digits' anagram.at n=12A034277
• Coefficients of power series that satisfies A(x)^2 - 4*x*A(x)^3 = 1, A(0)=1.at n=6A078531
• Start with Pascal's triangle; a(n) is the sum of the numbers on the periphery of the n-th central rhombus containing exactly 4 numbers.at n=7A081496
• Numbers whose number of divisors equals the sum of their separate prime-power decompositions.at n=14A087004
• Number of symmetric non-crossing connected graphs on n equidistant nodes on a circle.at n=12A089073
• "Correlation triangle" of central binomial coefficients A000984.at n=46A115255
• Dimensions of the irreducible representations of the simple Lie algebra of type F4 over the complex numbers, listed in increasing order.at n=16A121738
• G.f.: (5764801*x^8-5764801*x^7+28812*x^4-28812*x^3+840*x-1200)/(x-1).at n=3A137261
• a(1)=1, a(n)=a(n-1)+n^3 if n odd, a(n)=a(n-1)+ n^0 if n is even.at n=21A140152
• Triangle T(n,k) = 2^(k-1)*n*binomial(n-k,2*k-2)/(n-3*k+3) if k<n/3+1, else T(n,k)=1.at n=67A173988
• Number of n X n array permutations with each element moved no more than a city block distance of two.at n=2A188952
• Number of nX3 array permutations with each element moved no more than a city block distance of two.at n=2A188954
• T(n,k)=Number of nXk array permutations with each element moved no more than a city block distance of two.at n=12A188958
• Riordan matrix (1+x/sqrt(1-4*x),(1-sqrt(1-4*x))/2).at n=56A189175
• Row sums of the Riordan matrix (1+x/sqrt(1-4*x),(1-sqrt(1-4*x))/2) (A189175).at n=9A189176
• Number of -n..n arrays x(0..3) of 4 elements with zero sum and no two or three adjacent elements summing to zero.at n=17A200431
• Primitive triangle numbers as defined in A218243.at n=41A218392
• Triangle read by rows: T(n,r) = binomial(n,r)*binomial(2*n-3*r-4,n-2*r-2)/(n-r-1), n >= 2, r = 0..floor(n/2)-1.at n=31A259097
• Triangle where g.f. S = S(x,m) satisfies: S = x/(G(-S^2)*G(-m*S^2)) such that G(x) = 1 + x*G(x)^2 is the g.f. of the Catalan numbers (A000108), as read by rows of coefficients T(n,k) of x^(2*n-1)*m^k in S(x,m) for n>=1, k=0..n-1.at n=39A278880
• Triangle where g.f. S = S(x,m) satisfies: S = x/(G(-S^2)*G(-m*S^2)) such that G(x) = 1 + x*G(x)^2 is the g.f. of the Catalan numbers (A000108), as read by rows of coefficients T(n,k) of x^(2*n-1)*m^k in S(x,m) for n>=1, k=0..n-1.at n=41A278880