19120

Appears in sequences

• Arrange the nontrivial binomial coefficients C(m,k) (2 <= k <= m-2) in increasing order; record the positions of the central binomial coefficients.at n=13A022913
• a(n) = 2*n*(6*n-1).at n=40A126964
• Number of (w,x,y) with all terms in {0,...,n} and w>=range{w,x,y}.at n=31A212968
• G.f. A(x) satisfies A(x) = 1 + x * A(x) / A(x^2).at n=53A218033
• Number n such that a2 - n^3 is a triangular number (A000217), where a2 is the least square above n^3.at n=35A233400
• Number of (n+1) X (1+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 7 (constant-stress 1 X 1 tilings).at n=3A234721
• Number of (n+1) X (4+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 7 (constant-stress 1 X 1 tilings).at n=0A234724
• T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 7 (constant-stress 1 X 1 tilings).at n=6A234728
• T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 7 (constant-stress 1 X 1 tilings).at n=9A234728
• Sum of all the parts in the partitions of 4n into 4 parts.at n=9A238328
• Alternating sum of 10-gonal (or decagonal) pyramidal numbers.at n=30A269441
• Smallest number k such that gcd(s1, s2) = n, where s1 is the sum of the odd numbers and s2 is the sum of the even numbers in the Collatz (3x+1) trajectory of k.at n=48A271973
• Sum of all the parts in the partitions of n into 4 parts.at n=40A308775
• Number of integer partitions of n whose length times maximum is a multiple of n.at n=54A326849
• Number of integer compositions of n whose leaders of maximal strictly increasing runs sum to 2.at n=39A374705