41118

Appears in sequences

• a(n) = Sum_{d|n} (2^d*3^(n/d)).at n=8A038039
• Rectified hexateron (5-simplex) numbers: the coefficient of x^(2n-2) in (1+x+x^2+...+x^(n-1))^6.at n=11A179096
• G.f.: x^2 * f''(x), where f(x) = Product_{k>=1} (1 + x^k).at n=22A278407
• Number of nX3 0..1 arrays with no element unequal to more than four of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=5A281983
• Number of nX6 0..1 arrays with no element unequal to more than four of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=2A281986
• T(n,k)=Number of nXk 0..1 arrays with no element unequal to more than four of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=30A281988
• T(n,k)=Number of nXk 0..1 arrays with no element unequal to more than four of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=33A281988
• G.f. A(x,y) satisfies: Sum_{n=-oo...+oo} (x^n + y)^n = exp( (1-y) * A(x,y) ) / (1-y), where A(x,y) = Sum_{n>=1} x^n/n * Sum{k=0..n-1} T(n,k)*y^k, written here as a flattened triangle of coefficients T(n,k) read by rows.at n=33A321600
• Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 6).at n=12A322262