1440000

Appears in sequences

• Squares whose digits are squares.at n=36A019544
• Smallest number that has exactly n substrings which are square.at n=12A035237
• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*12^j.at n=17A038314
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*10^j.at n=18A038336
• Card-matching numbers (Dinner-Diner matching numbers).at n=11A059063
• Card-matching numbers (Dinner-Diner matching numbers).at n=13A059063
• Card-matching numbers (Dinner-Diner matching numbers).at n=29A059065
• Card-matching numbers (Dinner-Diner matching numbers).at n=31A059065
• a(n) = (2*n*(n+1))^2.at n=24A060300
• Squares such that each digit is a square and the sum of the digits is a square.at n=20A061270
• Product of nonzero digits of A066555(n).at n=9A066585
• Numbers k such that sigma(k) + phi(k) is a brilliant number (A078972).at n=33A115916
• 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=32A134434
• 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=33A134434
• Triangle T(n,k), 1 <= k <= n, read by rows: T(n,k) is the number of permutations of the set {2,4,6,...,2n} with k excedances. Equivalently, T(n,k) is the number of permutations in the symmetric group S_n having k multiplicative 2-excedances.at n=51A136715
• Triangle T(n,k), 1 <= k <= n, read by rows: T(n,k) is the number of permutations of the set {2,4,6,...,2n} with k excedances. Equivalently, T(n,k) is the number of permutations in the symmetric group S_n having k multiplicative 2-excedances.at n=52A136715
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k adjacent pairs of the form (odd,even) (0<=k<=floor(n/2)).at n=32A145891
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k adjacent pairs of the form (odd,even) (0<=k<=floor(n/2)).at n=33A145891
• Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that j and p(j) are of opposite parities for k values of j (0<=k<=n).at n=59A145893
• Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that j and p(j) are of opposite parities for k values of j (0<=k<=n).at n=61A145893