27768

Appears in sequences

• Number of (2n+1)-step self-avoiding walks on diamond lattice ending at point with x = 3.at n=4A001398
• Numbers n such that the Diophantine equation x^4+y^5=n^4 has solutions.at n=37A070756
• Row sums in A083175.at n=23A083175
• Indices of primes in sequence defined by A(0) = 41, A(n) = 10*A(n-1) + 81 for n > 0.at n=17A101738
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (-1, 1, -1), (0, 1, -1), (1, 0, 1)}.at n=9A149195
• a(n) gives the number of nonisomorphic connected compact Lie groups of dimension n which are simple products.at n=58A177821
• Number of nondecreasing arrangements of n+2 numbers in 0..8 with the last equal to 8 and each after the second equal to the sum of one or two of the preceding four.at n=32A189325
• Square table T(n, d) read by antidiagonals: number of ways to place 2 nonattacking kings on an n^d (n X n X ...) raumschach board (hypercubical chessboard).at n=24A194604
• Number of ways to place 2 nonattacking kings on an n X n X n X n raumschach board (four-dimensional chessboard).at n=4A194605
• Number of side-n hexagonal 0..2 arrays with values nondecreasing E, SW and SE.at n=3A216931
• T(n,k)=Number of side-n hexagonal 0..k arrays with values nondecreasing E, SW and SE.at n=13A216937
• Number of side-4 hexagonal 0..n arrays with values nondecreasing E, SW and SE.at n=1A216940
• Number of acyclic graphs on {1,2,...,n} such that the node with label 1 is in the same connected component (tree) as the node with label 2.at n=7A220690
• Triangle read by rows: Number of (2n+1)-step self-avoiding walks on diamond lattice ending at point with x = 2k+1.at n=16A227716
• Triangle read by rows: T(n,k) (0 <= k <= n) = Sum_{i=0..[k/2]} (-1)^i*binomial(k,2*i)*(2*i-1)!!*n^(k-2*i).at n=41A244490
• The growth series for the affine Coxeter (or Weyl) group [3,3,5] (or H_4).at n=41A266783
• Irregular triangle read by rows: T(n,m) = number of lattice paths of type B^Q terminating at point (n, m).at n=60A291087
• G.f. = Phi^4, where Phi = g.f. for A028930.at n=39A328529
• Array read by antidiagonals: T(n,k) is the number of functions f: X->Y, where X is a subset of Y, |X| = n, |Y| = n+k, such that for every x in X, f(f(x)) != x.at n=50A334014
• a(n) = binomial(n^2,n) mod n^5.at n=7A371471