26928

Appears in sequences

• Every run of digits of n in base 3 has length 2.at n=36A033001
• Number of paths from (0,0) to (n,n) that always move closer to (n,n) (and do not pass (n,n) and backtrack).at n=5A052141
• Ninth column (m=8) of convolution triangle A059594(n,m).at n=7A059597
• Numbers k such that sigma (x) = k has exactly 11 solutions.at n=31A060678
• Sixth column (m=5) of (1,6)-Pascal triangle A096956.at n=14A096959
• Number of line segments connecting exactly 7 points in an n X n grid of points.at n=41A177723
• Numbers with prime factorization pqr^2s^4.at n=26A190107
• Antidiagonal sums of the convolution array A213849.at n=31A213850
• Number of nX6 0..1 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=7A224036
• Irregular triangle read by rows: T(n,k) = number of set partitions of [1..n] with intertwining weight k.at n=39A226505
• a(n) = n*(2*n+1)*binomial(n+2,n)/3.at n=16A289643
• Primitive terms of A067808.at n=42A302127
• Sum of all the parts in the partitions of n into 5 parts.at n=36A308822
• Number A(n,k) of paths from {0}^k to {n}^k that always move closer to {n}^k; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=33A316674
• a(n) = Sum_{k=1..n} floor(k/2)! * floor((n - k)/2)! binomial((n-floor(k/2)-1), n-k).at n=12A339150
• Triangle read by rows: T(n,k) is the number of crystallized linear chord diagrams on n chords with k short chords.at n=29A375504