109000

Appears in sequences

• Number of compositions of n such that the greatest part occurs with even multiplicity.at n=19A105204
• Numbers k such that k and k^2 use only the digits 0, 1, 5, 8 and 9.at n=42A136874
• Numbers k such that k and k^2 use only the digits 0, 1, 6, 8 and 9.at n=45A136879
• Numbers k such that k and k^2 use only the digits 0, 1, 7, 8 and 9.at n=44A136880
• Numbers k such that k and k^2 use only the digits 0, 1, 8 and 9.at n=42A136881
• Number of obtuse isosceles triangles on an n X n grid.at n=23A190318
• Number of (n+1) X 3 0..1 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing.at n=12A203446
• Take a number z of x digits and consider any concatenation z = concat(y_1, y_2, ..., y_i) where y_1, y_2, ..., y_i have the same number of digits. Then be g(z) the product of the sums y_1 + y_2 + ... + y_i for all those concatenations. Sequence lists numbers z such that g(g(z)) = z. (See example.)at n=1A317628
• a(n) = Sum_{-n<i<n, -n<j<n, gcd{i,j}=2} (n-|i|)*(n-|j|).at n=28A331772