253125
domain: N
Appears in sequences
- Denominator of sum of -5th powers of divisors of n.at n=14A017674
- Numbers of form 5^i*9^j, with i, j >= 0.at n=28A025624
- Triangle whose (n,k)-th entry is 15^(n-k)*binomial(n,k).at n=16A027467
- a(n) = (n-1) * 15^(n-2).at n=4A027475
- Numbers whose prime factors are 3 and 5.at n=34A033849
- Odd numbers divisible by exactly 9 primes (counted with multiplicity).at n=29A046322
- Numerators of series related to triangular cacti.at n=7A058927
- Central term in powers of the Lo-Shu Magic Square as a matrix.at n=5A091281
- Expansion of g.f. (1-10x)/(1-15x).at n=5A091882
- A modular recurrence.at n=9A101553
- Number of n-tuples where each entry is chosen from the subsets of {1,2,3,4,5} such that the intersection of all n entries contains exactly one element.at n=3A128866
- Numbers of the form p^4*q^5 where p and q are two distinct primes.at n=6A179702
- a(n) = 5*n^4.at n=15A269792
- Numbers k such that k^4 is the average of a positive cube and a positive fifth power.at n=13A274027
- Number of set partitions of [n] such that i-j is a multiple of five for all i,j belonging to the same block.at n=19A275072
- Odd numbers k such that A173557(k) divides nonzero A051709(k).at n=13A345054
- Number of dominating sets in the n-alkane graph.at n=6A347501
- Triangular array read by rows. T(n,k) is the number of labeled directed graphs on [n] with exactly k strongly connected components of size 1 with outdegree zero, n>=0, 0<=k<=n.at n=16A362013
- Numbers k such that A006530(k) = A071178(k).at n=33A370492
- Square array read by upward antidiagonals: T(n, k) = denominator( 2*k!*(-2)^k*Sum_{m=1..n}( 1/(2*m-1)^(k+1) ) ).at n=42A370691