28101

Appears in sequences

• Number of walks of length 2n+7 in the path graph P_8 from one end to the other.at n=6A005023
• Distinct odd elements in 4-Pascal triangle A028275 (by row).at n=33A028281
• Odd elements (greater than 1) to right of central elements in 4-Pascal triangle A028275.at n=31A028287
• Partial sums of A007584.at n=16A051740
• Expansion of x / ( (x-1)*(x^3 - 9*x^2 + 6*x - 1) ).at n=7A094256
• Least multiple of 2n-1 ending in prime(n), 0 if no such number exists.at n=25A114780
• Numbers n such that A118799(n) = 0.at n=11A118578
• Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 1110-0100-0111 pattern in any orientation.at n=11A146874
• Number of n X 7 binary arrays without the pattern 0 1 diagonally or vertically.at n=5A188841
• Number of 4Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 0 1 vertically.at n=7A207786
• Composite squarefree numbers n such that p - tau(n) divides n - phi(n), where p are the prime factors of n, tau(n) = A000005(n) and phi(n) = A000010(n).at n=5A229323
• Number of walks in the first quadrant starting and ending at (0,0) consisting of 3n steps taken from {E=(1, 0), D=(-1, 1), S=(0, -1)}, no S step occurring before the final E step.at n=7A274969
• Expansion of x*(1 + 4*x + x^2)/((1 - x)^5*(1 + x)^4).at n=34A290055
• Triangle read by rows: T(n, k) = binomial(2*k + n - 1, k - 2)*(n^2 - 2*k + n)/(k*(k - 1)) for k >= 2, T(n, 0) = 1 and T(n, 1) = n - 1.at n=43A387700