25047

Appears in sequences

• a(n) = (1/12)*(n+5)*(n+1)*n^2.at n=22A014205
• Sum of squared terms in rows of the Padovan-Fibonacci triangle A152545.at n=15A152546
• a(n) = n*(n+1)*(14*n-11)/6.at n=22A172076
• Row sums of A051949 (differences of factorial numbers), seen as a triangle.at n=5A185009
• a(n) = (n^2 + 2*(Sum_{j = 1..n} j^n)) (mod n^3).at n=32A219540
• Number of n X 4 0..1 arrays with rows nondecreasing and antidiagonals unimodal.at n=6A224129
• T(n,k)=Number of nXk 0..1 arrays with rows nondecreasing and antidiagonals unimodal.at n=51A224133
• Number of 7 X n 0..1 arrays with rows nondecreasing and antidiagonals unimodal.at n=3A224138
• The Wiener index of the linear phenylene with n hexagons.at n=10A224454
• a(n) = 23*n^2.at n=33A244632
• Number of length 5 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7.at n=8A258636
• Number of compositions of n into distinct parts where each part i is marked with a word of length i over a nonary alphabet whose letters appear in alphabetical order.at n=5A261847
• Numbers such that the decimal digits of sigma(n) are a permutation of those of sigma(n)-n.at n=12A277114
• a(n) is the greatest integer k such that k/Fibonacci(n) < sqrt(2).at n=22A293418
• a(n) is the integer k that minimizes |k/Fibonacci(n) - sqrt(2)|.at n=22A293420
• Number of integer-sided pentagons having perimeter n, modulo rotations but not reflections.at n=43A293822
• a(n) = 3*p(n), where p(n) is the number of partitions of n.at n=32A299473
• Number of nX5 0..1 arrays with every element unequal to 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=5A316737
• Number of nX6 0..1 arrays with every element unequal to 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A316738
• T(n,k) = Number of n X k 0..1 arrays with every element unequal to 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=49A316740