24574

Appears in sequences

• Generalized Stirling numbers, [n+6,6]_4.at n=4A001717
• a(2*n) = 3*2^n - 2; a(2*n+1) = 2^(n+2) - 2.at n=26A027383
• a(n) = 3*2^n - 2.at n=13A033484
• Generalized Stirling number triangle of first kind.at n=23A049459
• a(3) = 1, otherwise a(n) = n*2^(n-3) - 2^(n-2) - 2.at n=11A058966
• Add 1, double, add 1, double, etc.at n=26A083416
• Duplicate of A033484.at n=13A099018
• Start with 1, then alternately double or add 2.at n=26A099942
• Integers that do not appear in A103502.at n=11A103504
• Numbers k such that hcl(k,k) < hcl(k,k-1) where hcl(k,i) is the Huffman code length; see comments.at n=25A126269
• Unsigned 4-Stirling numbers of the first kind.at n=23A143493
• Numbers k such that the digit sum of 167^k is divisible by k.at n=38A175552
• G.f. satisfies: A(x) = B(x/A(x)), where B(x) is the g.f. of A184509.at n=9A184510
• Number of bisymmetric, quasitrivial, and order-preserving binary operations on the n-element set {1,...,n}.at n=14A296953
• G.f. A(x) satisfies: A(x) = Sum_{n>=0} (1+x)^(n*(n+1)/2) * x^n / A(x)^n.at n=12A318644
• Triangle T(n, k) = [t^n] Gamma(n + k + m + t)/Gamma(k + m + t) for m = 2 and 0 <= k <= n, read by rows.at n=23A325139
• Number of partitions of [n] into m blocks that are ordered with increasing least elements and where block j contains n+1-j (m in {0..ceiling(n/2)}, j in {1..m}).at n=13A363071
• a(n) = n! * [x^n] (2*x - 4*exp(x) + 3*exp(2*x) + 3) / 2.at n=14A369491
• Triangle read by rows: T(n, k) = Sum_{i=0..n-k} Stirling1(i + m, m)*binomial(n+m+1, n-k-i)*(n + m - k)!/(i + m)!, for m = 2.at n=23A376634