23674
domain: N
Appears in sequences
- Molien series for complete weight enumerators of Hermitian self-dual codes over GF(9) containing the all-ones vector.at n=6A092355
- 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, 0), (0, 1, -1), (0, 1, 1), (1, 0, 1)}.at n=8A150226
- a(n) = (2*n^3 + 5*n^2 - 17*n)/2.at n=27A162259
- Number of -2..2 arrays x(0..n+2) of n+3 elements with zero sum and no two or three adjacent elements summing to zero.at n=6A200424
- T(n,k)=Number of -k..k arrays x(0..n+2) of n+3 elements with zero sum and no two or three adjacent elements summing to zero.at n=34A200430
- Number of -n..n arrays x(0..9) of 10 elements with zero sum and no two or three adjacent elements summing to zero.at n=1A200437
- Partial sums of A253088.at n=33A255048
- a(n) is the number of integer partitions of n for which the greatest part minus the least part is equal to the index of the seaweed algebra formed by the integer partition paired with its weight.at n=56A318176
- Number of compositions of n where every distinct subsequence (not necessarily contiguous) has a different sum.at n=44A334268