887040

Appears in sequences

• a(n) = a(n-1) + (3+(-1)^n)*a(n-2)/2.at n=22A007068
• a(n) = 4*a(n-1) - 2*a(n-2) with a(0) = 1, a(1) = 4.at n=11A007070
• Expansion of (theta_3(z^4)^3 + theta_2(z^4)^3)^4.at n=31A028697
• Expansion of e.g.f. 1/(1-2*x^2-x^3).at n=8A052684
• a(n) = n! * number of partitions of n.at n=8A053529
• Smallest number m such that GCD of d(m^2) and d(m) is 2n+1 where d(m) is the number of divisors of m.at n=13A061701
• a(0)=0; a(1)=1; a(n) = a(n-1) + (3 + (-1)^n)*a(n-2)/2.at n=24A062112
• a(n) = n*(n-1)*(n-3)*(n-5).at n=33A062765
• Reversion of g.f. (with constant term included) for partition numbers.at n=23A066398
• Number of n step walks (each step +/-1 starting from 0) which are never more than 3 or less than -3.at n=22A068912
• Hook products of all partitions of 11.at n=48A093790
• Hook products of all partitions of 11.at n=49A093790
• Expansion of x^3 / (1 - 4*x + 6*x^2 - 4*x^3 + 2*x^4).at n=25A099589
• Expansion of x^3 / (1 - 4*x + 6*x^2 - 4*x^3 + 2*x^4).at n=24A099589
• Row sums of triangle A099605, in which row n equals the inverse Binomial transform of column n of the triangle A034870 of even-indexed rows of Pascal's triangle.at n=11A099606
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 1-cell columns starting at level 0 (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=56A121585
• a(n) = 4*a(n-2) - 2*a(n-4).at n=24A121720
• a(1) = 1, a(n) = a(n-1) if n == 1 (mod 4), otherwise a(n) = n * a(n-1) for n >= 2.at n=10A123145
• Highly abundant numbers (A002093) that are not Harshad numbers (A005349).at n=12A128702
• A triangular sequence from umbral calculus expansion of _Simon Plouffe_'s rational polynomial for A002890: p(x,t) = exp(x*t)*(1 - 6*t + 9*t^2 - 4*t^3 + t^4)/(4*t - 1)/(2*t - 1).at n=38A137514