35451

Appears in sequences

• Shifts one place left under 5th-order binomial transform.at n=6A005011
• Number of segments (and sides) created by diagonals of an n-gon in general position.at n=24A014628
• Number of ordered positive integer solutions (m_1, m_2, ..., m_k) (for some k) to Sum_{i=1..k} m_i=n with |m_i-m_{i-1}| <= 1 for i = 2 ... k.at n=21A034297
• Minimum solution for tri-color tower of Hanoi, restricted so like colors can't be together.at n=12A055622
• Triangle, generated from A111579.at n=71A111673
• Enneagonal numbers divisible by 9.at n=23A117796
• Row sums of triangle A134392.at n=25A134393
• Number of line segments in regular n-gon with all diagonals drawn.at n=26A135565
• a(n) = (4*n^3 + n^2 - 3*n)/2.at n=26A172073
• Number of strings of n+2 numbers x(i) in -7..7 with the sum of x(i) equal to zero and the sums of x(i)*x(i+1) and x(i)*x(i+2) equal to each other.at n=4A184059
• a(n) = prime(n)*T(n), where T = A000217.at n=25A196421
• Number of nondecreasing -7..7 vectors of length n whose dot product with some lexicographically greater or equal nondecreasing -7..7 vector equals n.at n=5A226421
• Number of nondecreasing -n..n vectors of length 6 whose dot product with some lexicographically greater or equal nondecreasing -n..n vector equals 6.at n=6A226427
• Square array read by antidiagonals upwards: T(n,k) = Sum_{j=1..k} n^(k-j)*Stirling_2(k,j) (n >= 0, k >= 1).at n=60A241578
• Square array read by antidiagonals downwards: T(n,k) = Sum_{j=1..k} n^(k-j)*Stirling_2(k,j) (n >= 0, k >= 1).at n=60A241579
• Triangle read by rows. T(n, k) = k^n * BellPolynomial(n, 1/k) for k > 0, if k = 0 then T(n, k) = k^n.at n=26A350260