32461

Appears in sequences

• Expansion of e.g.f. x*cos(sinh(x)) (odd powers only).at n=5A009057
• a(0)=1, a(1)=1, a(n) = 13*a(n/2) for n=2,4,6,..., a(n) = 12*a((n-1)/2) + a((n+1)/2) for n=3,5,7,....at n=22A116524
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 1), (0, -1), (1, 0)}.at n=15A151497
• Fibonacci sequence beginning 9, 7.at n=18A190995
• Number of length 1+4 0..n arrays with every five consecutive terms having the maximum of some two terms equal to the minimum of the remaining three terms.at n=9A254699
• Number A(n,k) of lattice paths starting at {n}^k and ending when k or any component equals 0, using steps that decrement one or more components by one; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=30A263159
• Number of lattice paths starting at {n}^5 and ending when any component equals 0, using steps that decrement one or more components by one.at n=2A263163
• Number of non-abelian groups of order prime(n)^6.at n=24A271811
• G.f. A(x,y) satisfies: A( x - y*A(x,y)^2, y) = x + (1-y)*A(x,y)^2, where the coefficients T(n,k) of x^n*y^k form a triangle read by rows n>=1, for k=0..n-1.at n=30A277295
• Column 2 of triangle A277295; a(n) = A277295(n+2,2).at n=5A277296