25231

Appears in sequences

• Last number of height n in Recamán's sequence A005132.at n=29A064293
• Number of permutations satisfying i-4<=p(i)<=i+4, i=1..n (permutations of length n within distance 4).at n=9A072856
• a(n) = 24*5^n - 60*4^n + 50*3^n - 15*2^n + 1.at n=5A091348
• Let X_{m,n}(q) be the chromatic polynomial of the complete bipartite graph K_{m,n}. Then a(n) is the negative of the coefficient of the linear term of X_{n,n}(q).at n=5A092552
• a(n) = n^3 + n^2 + 1.at n=29A098547
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,k+n} having excedance set {1,2,...,k} (the empty set for k=0), 0 <= k <= n-1.at n=40A136126
• a(n) = 841*n + 1.at n=29A158404
• a(n) = 30*n^2 + 1.at n=29A158558
• a(n) = prime(n)^3 + prime(n)^2 + 1.at n=9A181151
• Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=4A251946
• Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=3A251947
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=31A251950
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=32A251950
• a(n) = G_n(5), where G_n(k) is the Goodstein function defined in A266201.at n=18A266204
• Numbers k such that the coefficient of x^k in the expansion of Product_{j>=1} (1 - x^j)^5 is zero.at n=30A302057
• Number of permutations of [n] within distance floor(n/2) of a fixed permutation.at n=9A306267