78000

Appears in sequences

• Generalized tangent numbers d_(n,2).at n=24A000176
• Number of strings of length n over Z_5 with trace 0 and subtrace 1.at n=8A073964
• Number of strings of length n over Z_5 with trace 0 and subtrace 2.at n=8A073965
• Number of strings of length n over Z_5 with trace 1 and subtrace 0.at n=8A073966
• Number of strings of length n over Z_5 with trace 1 and subtrace 2.at n=8A073968
• Number of strings of length n over Z_5 with trace 1 and subtrace 3.at n=8A073969
• Number of strings of length n over Z_5 with trace 1 and subtrace 4.at n=8A073970
• Number of elements of GF(5^n) with trace 0 and subtrace 1.at n=8A074007
• Number of elements of GF(5^n) with trace 0 and subtrace 2.at n=8A074008
• Number of elements of GF(5^n) with trace 1 and subtrace 0.at n=8A074009
• Number of elements of GF(5^n) with trace 1 and subtrace 2.at n=8A074011
• Number of elements of GF(5^n) with trace 1 and subtrace 3.at n=8A074012
• Number of elements of GF(5^n) with trace 1 and subtrace 4.at n=8A074013
• Numbers n in which the last K digits of n form an integer divisible by K^3, for K = 1, 2, ..., M, where M is the number of digits in n.at n=48A079239
• Triangle T(n,k) read by rows: number of permutations in [n] with exactly k ascents that have an odd number of inversions.at n=40A128613
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=13.at n=13A135198
• Numbers k such that k and k^2 use only the digits 0, 4, 6, 7 and 8.at n=15A136954
• Triangle read by rows: T(n,k) is the number of odd permutations of {1,2,...,n} having k descents. (n>=1, k>=1).at n=29A145883
• Numbers with prime factorization pqr^3s^4.at n=25A190294
• a(n) = Sum_{d|n} mu(n/d)*5^(d-1).at n=7A295506