18228

Appears in sequences

• Sum along upward diagonal of Pascal triangle from (but not including) halfway point.at n=22A010758
• Sum along upward diagonal of Pascal triangle from halfway point.at n=22A010759
• a(n) = T(n, 2*n-10), T given by A027926.at n=11A027933
• a(n) = T(2*n, n+3), T given by A027935.at n=5A027939
• Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 90.at n=26A031588
• Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 90.at n=2A031768
• Partial sums of A053739.at n=10A053295
• a(n) = n^3 + (n + 1)^4 + (n + 2)^5.at n=5A061223
• a(n) = (n+1)(n+2)^2*(n+3)^2*(n+4)(7n^2 + 23n + 20)/2880.at n=5A108178
• Number of permutations of length n which avoid the patterns 1423, 3421.at n=8A116710
• Sum of the absolute values in row n of A118686.at n=6A119489
• Eigentriangle of triangle A022166: T(n,k) = A022166(n,k) * A125812(k).at n=25A143774
• a(n) = 2025*n^2 + n.at n=2A156856
• q-Carlitz-Al-Salam-Appell polynomial coefficients:q=2; p(x,n)=x*p[x, n - 1] - (1 - q^(n - 1))*q^(n - 2)*p[x, n - 2].at n=23A156960
• Number of partitions of n containing at least one part m-9 if m is the largest part.at n=34A212549
• Number of self-inverse permutations p on [n] where the maximal displacement of an element equals 10.at n=12A238921
• n! mod n^3.at n=30A242427
• Number of (n+1)X(n+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=3A262413
• Number of (n+1) X (4+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=3A262416
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=24A262420