93750
domain: N
Appears in sequences
- Expansion of (1+x)/(1-5*x).at n=7A003948
- a(n) = Product_{i=0..6} floor((n+i)/7).at n=36A009641
- Numbers of form 5^i*6^j, with i, j >= 0.at n=29A025622
- a(n) = n*5^n.at n=6A036291
- Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*5^j.at n=22A038247
- Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*5^j.at n=26A038247
- Sums of two distinct powers of 5.at n=27A038474
- Sums of two powers of 5.at n=34A055237
- Numbers n such that n | 4^n + 3^n + 2^n + 1^n.at n=38A056643
- Numbers k such that k | 6^k + 5^k + 4^k + 3^k + 2^k.at n=41A057256
- Numbers n that are the hypotenuse of exactly 6 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 6 ways.at n=4A097219
- Numbers n such that the period length P(n) of the Fibonacci sequence mod n is a multiple of n.at n=38A105953
- a(n) = 5^n * n*(n + 1).at n=5A116156
- Triangle T, read by rows, where matrix power T^5 has powers of 5 in the secondary diagonal: [T^5](n+1,n) = 5^(n+1), with all 1's in the main diagonal and zeros elsewhere.at n=11A117256
- a(3n) = 3a(3n-1)-3a(3n-2)+2a(3n-3), a(3n+1) = 3a(3n)-3a(3n-1)+2a(3n-2), a(3n+2) = 3a(3n+1)-3a(3n), a(0) = 0, a(1) = 1, a(2) = 2.at n=23A131761
- Array, a(n,k) = total size of all n-length words on a k-letter alphabet, read by antidiagonals.at n=49A134574
- Areas, in ascending order, of integer-sided right triangles whose hypotenuses are squares.at n=17A141502
- Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^8 = I.at n=7A164741
- Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^9 = I.at n=7A165213
- Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^10 = I.at n=7A165777