34884

Appears in sequences

• Expansion of 1/((1+x)*(1-x)^5).at n=33A001752
• Even numbers (not equal to 2) to the left of the central elements of the (2,3)-Pascal triangle A029600.at n=40A029613
• If n mod 2 = 0 then m := n/2 and a(n) = (3*m)!*(5*m+1)/((m+1)!*(2*m+1)!); otherwise m := (n-1)/2, a(n) = 6*(3*m+2)!/(m!*(2*m+3)!).at n=14A047750
• a(n) = 9*binomial(n,4) = 3*n*(n-1)*(n-2)*(n-3)/8.at n=19A060008
• Binary string self-substitutions: a(n) is obtained by substituting the binary expansion of n for each 1-bit in the binary expansion of n.at n=34A065159
• Sixth column (m=5) of (1,4)-Pascal triangle A095666.at n=16A095668
• Sixth column (m=5) of (1,6)-Pascal triangle A096956.at n=15A096959
• Maximal number of 165432 patterns in a permutation of 1,2,...,n.at n=21A100356
• Numbers that have exactly seven prime factors counted with multiplicity (A046308) whose digit reversal is different and also has 7 prime factors (with multiplicity).at n=23A109027
• a(n) = n^2*(n^2 - 1)/3.at n=18A112742
• Define an array by d(m, 0) = 1, d(m, 1) = m; d(m, k) = (m - k + 1) d(m+1, k-1) - (k-1) (m+1) d(m+2, k-2). Sequence gives d(n,4).at n=16A126958
• a(n) = (n-1)*n*(n+1)*(n+2)*(2n+11)/120.at n=16A130857
• T(n,k) = Number of n X k 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=47A207453
• Number of 3 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=7A207454
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=47A208555
• Number of partitions of n in which no parts are multiples of 6.at n=43A219601
• a(n) = 3*binomial(n+1, 5).at n=17A253942
• Numbers n such that 2*n and n^3 have the same digit sum.at n=15A266315
• Number of partitions of n whose minimal excluded multiplicity is odd.at n=44A300183
• Sum of all the parts in the partitions of n into 5 parts.at n=38A308822