360000
domain: N
Appears in sequences
- Numbers of form 6^i*10^j with i, j >= 0.at n=26A025629
- Number of ways to place a non-attacking white and black rook on n X n chessboard.at n=24A035287
- Squares which are the sum of twin prime pairs.at n=17A037072
- Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*10^j.at n=18A038264
- Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*6^j.at n=17A038308
- Sigma(n) / d(n) is a perfect square associated with A049226.at n=29A049227
- Card-matching numbers (Dinner-Diner matching numbers).at n=9A059063
- Card-matching numbers (Dinner-Diner matching numbers).at n=15A059063
- Card-matching numbers (Dinner-Diner matching numbers).at n=33A059065
- Card-matching numbers (Dinner-Diner matching numbers).at n=27A059065
- Numbers n such that n and its 10's complement are both squares, i.e., n and 10^k - n (where k is the number of digits in n) are squares.at n=17A068810
- Numbers k such that the numerator of Sum_{d|k} 1/d > 3*k.at n=20A069096
- Square associated with twin primes (p,p+2): p(p+2) + 1. Square of the average of twin primes.at n=26A075369
- a(1)=0, a(2)=9; then distinct squares such that the sum of three successive terms is a square.at n=8A075373
- Perfect squares using only the curved digits 0, 3, 6, 8 and 9.at n=14A079655
- T(n,k) = (floor(k*n/2) * ceiling(k*n/2))^2, triangular array read by rows, 1 <= k <= n.at n=27A089083
- Denominators of the triangle of coefficients T(n,k), read by rows, that satisfy: y^x = Sum_{n=0..x} R_n(y)*x^n for all nonnegative integers x, y, where R_n(y) = Sum_{k=0..n} T(n,k)*y^k and T(n,k) = A107045(n,k)/a(n,k).at n=16A107046
- Squares for which the sum of the digits, the product of the digits, the digital root and the multiplicative digital root are all squares.at n=35A117680
- Perfect powers which are the sum of twin prime pairs.at n=20A119767
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k even entries that are followed by a smaller entry (n>=0, k>=0).at n=31A134434