25235

Appears in sequences

• a(n) = dot_product(n,n-1,...2,1)*(5,6,...,n,1,2,3,4).at n=44A026060
• Denominators of continued fraction convergents to sqrt(303).at n=8A041571
• Fourth convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.at n=6A073381
• a(n) = 4 + floor((3 + Sum_{j=1..n-1} a(j))/4).at n=39A120163
• Value of A063882 at end of n-th generation of terms.at n=13A132177
• Numbers of the form 49*k, where 49*k+2 and 49*k-6 are both prime.at n=9A153779
• 7 times octagonal numbers: a(n) = 7*n*(3*n-2).at n=35A153797
• Triangle read by rows: T(n,0) = T(n,n) = 1 for n >= 0, T(n,k) = ((n - 1)! + 1)*binomial(n, k) for 1 <= k <= n - 1, n >= 2.at n=31A168621
• Triangle read by rows: T(n,0) = T(n,n) = 1 for n >= 0, T(n,k) = ((n - 1)! + 1)*binomial(n, k) for 1 <= k <= n - 1, n >= 2.at n=32A168621
• Number of 0..4 arrays x(0..n) of n+1 elements with zero n-1st differences.at n=17A200078
• Numbers n such that n!10 + 2 is prime.at n=50A204657
• Second-order spt function.at n=18A221140
• G.f. satisfies: A(x) = -1 + x + A(x)^2 + 1/A(x)^2.at n=6A228714
• Triangle T(n, k) = Sum_{i=1..n} Stirling2(n,i) * abs(Stirling1(i-1,k-1)), n >= 1, 1 <= k <= n.at n=31A320280
• Main diagonal of A332363.at n=22A332364
• Triangular array read by rows. T(n,k) is the number of elements of rank k in the order complex of the poset P = [n] X [n], n=0, k=0 or n>0, 0<=k<=2n-1.at n=47A337192
• Numbers k such that k and k+1 have the same sum of powerful divisors (A183097) and this sum is larger than 1.at n=6A349063
• Square array A(i,j), i >= 0, j >= 0, read by antidiagonals: A(i,j) = Sum_{|X|=0..i} Sum_{|Y|=0..i} Product_{k=1..j} (1+X(k)+Y(k)), where X and Y are multi-indices of length j.at n=32A358628
• Expansion of e.g.f. exp(x^4/(24 * (1 - x)^3)).at n=8A373759