25473

Appears in sequences

• Molien series for complete weight enumerators of self-dual codes over GF(9).at n=13A092071
• Triangle T(n,k), n>=1, 0<=k<=n-1, read by rows: T(n,k)/(n-1)! is the coefficient of x^k in polynomial p_n for the n-th row sequence of A145153.at n=50A145142
• 5th column of A145142.at n=4A145147
• 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, 0), (-1, -1, 1), (-1, 0, -1), (0, -1, -1), (1, 1, 1)}.at n=9A149500
• Coefficients of expansion polynomial:p(x,t)=Exp[ -t^2* x](1 - t)^(-x)/x.at n=50A174893
• Number of peakless Motzkin paths of length n containing no subwords of type uh^ju or dh^jd (j>=1), where u=(1,1), h=(1,0), and d=(1,-1) (can be easily expressed using RNA secondary structure terminology).at n=17A190160
• Expansion of (psi(x^3) / psi(x))^2 in powers of x where psi() is a Ramanujan theta function.at n=34A217786
• Triangular array: Number of partitions of the vertex set of a forest of two trees on n vertices into k nonempty independent sets.at n=61A227341
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 777", based on the 5-celled von Neumann neighborhood.at n=30A273532
• a(n) = Fibonacci(n) represented in bijective base-7 numeration.at n=19A282238
• a(n) is the least k such that A295520(k) = n.at n=50A295793