11010048

Appears in sequences

• Number of 3 X 3 matrices whose determinant is 1 mod n.at n=7A011785
• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*8^j.at n=33A038238
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*4^j.at n=30A038282
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*6^j.at n=29A038284
• a(0)=0, a(1)=1, a(n) = n*2^(n-2) for n >= 2.at n=21A057711
• a(n) is the least k with n prime factors (counting multiplicity) such that the sum of these n factors divides k. First member of A036844 with n prime factors.at n=20A104465
• a(n) = 8^n * n*(n+1).at n=6A116166
• Binomial transform of A124625.at n=21A129952
• a(n) is the smallest positive integer m with exactly n zeros in its binary representation and with n represented in binary as a substring of the binary representation of m.at n=20A147761
• a(n) = 21*2^n.at n=19A175805
• Triangular array read by rows: T(n,k) is the number of connected components with size k summed over all simple labeled graphs on n nodes; n>=1, 1<=k<=n.at n=38A223894
• Number of defective 3-colorings of an n X 2 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=10A229580
• Number of (n+2)X(n+2) 0..3 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=23A253017
• a(n) = the number of hills (arch length of 1 with no covering arches) for semi-meander solutions with n arches and floor((n+2)/2) arch group returns to the x axis.at n=40A262258
• a(n) is the least number of the form p^2 + q^2 - 2 for primes p and q that is an odd multiple of 2^n, or -1 if there is no such number.at n=19A359439
• Expansion of e.g.f. (1+x)*cosh(x)^2.at n=21A383608
• Expansion of e.g.f. cosh(x)^2*(x+x^2/2).at n=21A385601
• Expansion of e.g.f. cosh(x)^2*(1 + x + x^2/2).at n=21A386227