29596

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=15A049946
• Triangle read by rows giving coefficients of polynomials arising in successive differences of (n!)_{n>=0}.at n=41A094791
• Triangle T, read by rows, equal to Pascal's triangle to the matrix power of Pascal's triangle, so that T = C^C, where C(n,k) = binomial(n,k) and T(n,k) = A000248(n-k)*C(n,k).at n=38A116071
• Number of pairs (not necessarily successors) of partitions of n that are incomparable in dominance (natural, majorization) ordering.at n=17A248476
• Triangle read by rows: T(n,k) is the number of partial idempotent mappings (of an n-chain) with breadth exactly k.at n=42A259760
• Triangle read by rows, T(n,k) = Sum_{j=0..n} C(-j,-n)*S1(j,k), S1 the Stirling cycle numbers A132393, for n>=0 and 0<=k<=n.at n=49A269954
• Binary "cubes"; numbers whose binary representation consists of three consecutive identical blocks.at n=27A297405
• Number of compositions of n with the multiplicity of the first part even.at n=16A331609
• Expansion of e.g.f. -log(1-x)^3 * exp(-x) / (6 * (1-x)).at n=8A381068
• Consecutive states of the linear congruential pseudo-random number generator (257*s + 41) mod 2^16 when started at s=1.at n=35A384961
• Numbers whose binary expansion consists of alternating runs of 1's and 0's where each run of 0's is exactly one shorter than the preceding run of 1's, and the expansion ends with a 0-run.at n=42A387270