25012

Appears in sequences

• a(n) = (2*n - 15)*n^2.at n=26A015247
• a(n+2) = 5*a(n+1) - 3*a(n).at n=7A018902
• Number of triangular regions in regular n-gon with all diagonals drawn.at n=34A062361
• Numbers k such that Sum_{i=1..k} gcd(k,i) divides Sum_{i=1..k} lcm(k,i).at n=10A072109
• a(n+2) = 5*a(n+1) - 3*a(n) (n >= 1); a(0) = 0, a(1) = 1, a(2) = 4.at n=8A095940
• Omit the initial 1 from A000141 and take the Mobius transform.at n=38A190622
• Triangle read by rows, giving antidiagonals of an array of sequences representing the number of compositions of n when there are N types of ones (the sequences in the array begin (1, N, ...)).at n=62A228352
• Number of (n+2)X(2+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal sum minus antidiagonal sum unequal to its neighbors horizontally and vertically.at n=4A253734
• Number of (n+2) X (5+2) 0..1 arrays with every 2 X 2 and 3 X 3 subblock diagonal sum minus antidiagonal sum unequal to its neighbors horizontally and vertically.at n=1A253737
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal sum minus antidiagonal sum unequal to its neighbors horizontally and vertically.at n=16A253740
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal sum minus antidiagonal sum unequal to its neighbors horizontally and vertically.at n=19A253740
• a(n) = Sum_{i=1..floor((n-1)/2)} i * (n-i)^2.at n=25A308038
• Number of squarefree parts in the partitions of n into 10 parts.at n=39A309464
• Array read by antidiagonals: A(n,m) is the number of ways to place non-adjacent counters on the black squares of a 2n-1 X 2m-1 checker board.at n=47A331406
• Array read by antidiagonals: A(n,m) is the number of ways to place non-adjacent counters on the black squares of a 2n-1 X 2m-1 checker board.at n=52A331406