19596

Appears in sequences

• Number of partitions satisfying (cn(0,5) = cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=65A036824
• Number of additive cyclic codes over GF(4) of length n that can be generated by one codeword.at n=11A143696
• 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), (1, 0, 0), (1, 1, -1)}.at n=11A148042
• a(n) = p(n+1)^2 + 2*p(n) + 1; p(n) is the n-th prime number and n >= 1.at n=32A155819
• a(n) = 16*n^2 - 4.at n=34A158443
• Number of reduced 3 X 3 magilatin squares with magic sum n.at n=25A174020
• G.f. satisfies: A(x) = 1 + x*( d/dx x*A(x) )^3.at n=5A211824
• Number of (n+4)X6 0..2 matrices with each 5X5 subblock idempotent.at n=2A224619
• Number of (n+4)X7 0..2 matrices with each 5X5 subblock idempotent.at n=1A224620
• T(n,k)=Number of (n+4)X(k+4) 0..2 matrices with each 5X5 subblock idempotent.at n=7A224625
• T(n,k)=Number of (n+4)X(k+4) 0..2 matrices with each 5X5 subblock idempotent.at n=8A224625
• Number of set partitions of [n] such that j is member of block b only if b = 1 or at least one of j-1, ..., j-3 is member of a block >= b-1.at n=9A287666
• Number of partitions of n into colored blocks of equal parts, such that all colors from a set of size eight are used and the colors are introduced in increasing order.at n=18A327291
• G.f.: Sum_{k>=0} x^(2^k) / (1 - x^(2^k))^4.at n=45A338046
• Number of unordered pairs of partitions of n with the same number of parts.at n=20A387259