25488
domain: N
Appears in sequences
- Number of n-step mappings with 5 inputs.at n=7A005946
- Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 25 (most significant digit on right and removing all least significant zeros before concatenation).at n=13A029542
- Numbers n such that 179*2^n-1 is prime.at n=4A050841
- Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; each k is an R(i(k),j(k)) and A057047(n)=j(2^n).at n=30A057047
- Number of 8-level labeled rooted trees with n leaves.at n=5A081624
- Determinants of 5 X 5 matrices consisting of 25 consecutive primes.at n=16A118815
- a(n) = (8/9)*(2+7*(-8)^(n-1)).at n=5A165748
- Number of reduced 3 X 3 magilatin squares with largest entry n.at n=17A174018
- Numbers of the form p^4*q^3*r where p, q, and r are distinct primes.at n=30A179698
- The Wiener index of the Dutch windmill graph D(6,n) (n>=1).at n=23A180578
- Number of 3X3X3 triangular 0..n arrays with every horizontal row having the same average value.at n=16A214596
- Composite numbers such that sum_{i=1..k} (p_i/(p_i+1))/product_{i=1..k} (p_i/(p_i+1)) is an integer, where p_i are the k prime factors of n (with multiplicity).at n=22A227248
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 593", based on the 5-celled von Neumann neighborhood.at n=29A273121
- Consider all 3 X 3 matrices M whose entries are the n-th to (n+8)-th primes prime(n), ..., prime(n+8), in any order. a(n) is the sum of the number of M such that det(M) is divisible by prime(n+i), for i from 0 to 8.at n=27A339105
- a(n) = Sum_{k=1..n} phi(k) * (floor(n/k)^4 - floor((n-1)/k)^4).at n=17A344600
- Numbers k for which A306927(k) [= A001615(k)-k] is a multiple of A344705(k) [= A001615(k)-A001065(k)], and their quotient is nonnegative.at n=34A344700
- a(n) = n! * (1 + Sum_{k=0..n} (-1)^k * k / k!).at n=8A368765
- Number of palindromic periodicities among the binary words of length n.at n=17A374495
- a(n) is the least number k such that both k and k + s have n prime divisors, counted with multiplicity, where s is the sum of the decimal digits of k.at n=7A382996
- Totient numbers k that divide A215240(k).at n=3A389861