24604
domain: N
Appears in sequences
- Number of factorization patterns of polynomials of degree n over F_4.at n=22A006169
- a(1)=1, a(n) = n*3^(n-1) + a(n-1).at n=7A014915
- Number of partitions of n in which the least part is even.at n=49A026805
- Expansion of (1-x)/(1 - 2*x - x^4 + x^5).at n=15A052932
- Square array T(n,k) read by antidiagonals where T(0,k) = 0 and T(n,k) = 1 + 2k + 3k^2 + ... + n*k^(n-1).at n=69A059045
- a(n) = 2*a(n-1) + 3*a(n-2), a(0) = 1, a(1) = 4.at n=9A060925
- Triangle read by rows, generated from (..., 3, 2, 1).at n=52A108283
- a(n) = 1 + 2*n + 3*n^2 + 4*n^3 + 5*n^4 + 6*n^5 + 7*n^6 + 8*n^7.at n=3A113618
- T(n, k) = 3*T(n-1, k-1) + T(n-1, k) for k < n and T(n, n) = 1, T(n, k) = 0, if k < 0 or k > n; triangle read by rows.at n=52A119673
- Triangle read by rows: iterates of X * [1,0,0,0,...]; where X = an infinite lower bidiagonal matrix with [3,1,3,1,3,1...] in the main diagonal and [1,1,1,...] in the subdiagonal.at n=47A140071
- First differences of A145646.at n=12A145647
- 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, 1, 1), (1, 0, -1), (1, 1, 1)}.at n=9A149273
- Number of n X n arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to 49.at n=5A156511
- Triangular array: the fission of the polynomial sequence ((x+1)^n: n >= 0) by the polynomial sequence ((x+2)^n: n >= 0). (Fission is defined at Comments.)at n=43A193842
- Mirror image of the triangle A193842.at n=37A193843
- Let K be a local ring with a principal maximal ideal J of nilpotent degree 3 with |K/J|>2; a(n) = number of D-invariant ideals in the ring R_n(K,J).at n=5A221703
- a(n) = sum of all divisors of all positive integers <= prime(n).at n=39A244583
- Triangle read by rows: T(n,k) is the coefficient A_k in the transformation Sum_{k=0..n} (k+1)*x^k = Sum_{k=0..n} A_k*(x-3)^k.at n=28A246799
- a(0)=0, a(1)=1, a(n) = min{3 a(k) + (3^(n-k)-1)/2, k=0..(n-1)} for n>=2.at n=36A259653
- a(n) = smallest m such that A308190(m) = n, or -1 if no such m exists.at n=24A308191