194400

Appears in sequences

• Highly powerful numbers: numbers with record value of the product of the exponents in prime factorization (A005361).at n=27A005934
• a(n) = Product_{i=0..6} floor((n+i)/7).at n=40A009641
• Numbers of form 5^i*6^j, with i, j >= 0.at n=33A025622
• Sum of divisors of those numbers n such that n and n+1 have the same sum of divisors.at n=24A053215
• Sum of divisors of k such that k and k+1 have the same number and sum of divisors.at n=8A054005
• a(n) = (n-1)! * Sum_{k=1..n} floor(k^k/k!).at n=6A054202
• a(n) = 25*6^(n-2), with a(0)=1 and a(1)=4.at n=7A055846
• Leading least prime signatures: a(n) is in A025487 but a(n)/2 is not.at n=31A056153
• a(n) = n^2*6^n.at n=5A128785
• Elements n of A141586 with property that A100762(n) = n.at n=19A141758
• Number of reduced 3 X 3 semimagic squares with distinct nonnegative integer entries and maximum entry n.at n=29A173727
• Irregular triangle T(n,k) = A096162(n,k) * A036040(n,k) * A048996(n,k) * A098546(n,k) * A178886(n,k), read by rows, 1 <= k <= A000041(n).at n=27A179236
• Prime encoded sequence of generic integer partitions of n in the antilexicographic order of the partitions.at n=20A182911
• Sum of all the parts in the partitions of 4n into 4 parts.at n=17A238328
• Triangle read by rows: coefficients T(n,k) of a binomial decomposition of n as Sum(k=0..n)T(n,k)*binomial(n,k).at n=42A244132
• a(n) = (n^2 + 4*n + 6) * n^2.at n=20A258402
• Average of amicable pairs (x,y), ordered by the smaller value x given in A002025.at n=20A275315
• Average of amicable pairs (x,y), ordered by the sum x+y given in A259953.at n=20A275316
• A multiplicative encoding (compressed) for the exponents of 2 obtained when using Shevelev's algorithm for computing A002326.at n=23A292265
• Triangle read by rows: T(n,k), n>=2, 1 <= k <= n-1, is the number of permutations in S_n in which there are k different values for the values mod n of the differences between adjacent elements when written in row notation.at n=43A294789