22020096

Appears in sequences

• a(n) = n*2^(n-1).at n=21A001787
• a(n) = lcm(n, 2^(n-1)).at n=20A014964
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*12^j.at n=29A038290
• Triangle T(n,k) = C_n(k) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1<=k<=n).at n=26A058843
• a(n) = 2^(2*n)*(2*n+1).at n=10A058962
• Refactorable numbers x, such that quotient x/A000005(x) equals a power of 2.at n=22A078541
• Total number of edges in all labeled graphs on n nodes.at n=6A095351
• Expansion of g.f. (1-4*x+5*x^2)/(1-2*x)^2.at n=22A097067
• Smallest number beginning with the digits of n that has exactly n prime factors (counted with multiplicity).at n=21A109686
• Triangle read by rows: T(n,k) (0<=k<=n) is the number of labeled graphs having k blue nodes and n-k green ones and only nodes of different colors can be joined by an edge.at n=48A111636
• Triangle read by rows: T(n,k) (0<=k<=n) is the number of labeled graphs having k blue nodes and n-k green ones and only nodes of different colors can be joined by an edge.at n=51A111636
• Column 0 of triangle A118441, which is the matrix log of triangle A118435.at n=21A118442
• Triangle: signed version of A055134.at n=48A137370
• a(n)=4a(n-2).at n=21A137480
• Binomial transform of A004526.at n=22A139756
• a(n) = binomial(n+3, 3)*8^n.at n=6A140802
• Triangle t(n,m)= (m+1)^n*binomial(n,m) if m <= n/2, otherwise t(n,m) = t(n,n-m).at n=48A167034
• a(n) = 21*2^n.at n=20A175805
• G.f.: Sum_{n>=0} (n+1)*(n+2)/2 * 2^(n*(n-1)) * x^n.at n=5A202944
• Number of (possibly overlapping) occurrences of the subword given by the binary expansion of n in all binary words of length n.at n=25A228612