505000

Appears in sequences

• a(n) = A069537(n)/2.at n=19A088404
• Numbers k such that k and k^2 use only the digits 0, 2, 3 and 5.at n=37A136887
• Numbers k such that k and k^2 use only the digits 0, 2, 3, 5 and 7.at n=48A136889
• Numbers k such that k and k^2 use only the digits 0, 2 and 5.at n=17A136910
• Numbers k such that k and k^2 use only the digits 0, 2, 5 and 7.at n=22A136915
• Numbers k such that k and k^2 use only the digits 0, 2, 5, 7 and 8.at n=49A136916
• Numbers k such that k and k^2 use only the digits 0, 2, 5 and 8.at n=22A136918
• Numbers k such that k and k^2 use only the digits 0, 2, 5, 8 and 9.at n=47A136919
• Numbers k such that k and k^2 use only the digits 0, 2, 5 and 9.at n=35A136920
• a(n) = n^4*(n^2 + 1)/2.at n=10A168192
• Number of n X n 0..2 arrays with no element equal the average of immediate neighbors vertically above and horizontally left of it.at n=3A208438
• Number of nX4 0..2 arrays with no element equal the average of immediate neighbors vertically above and horizontally left of it.at n=3A208441
• T(n,k)=Number of nXk 0..2 arrays with no element equal the average of immediate neighbors vertically above and horizontally left of it.at n=24A208445
• Numbers in which each digit equals the sum (mod 10) of the other digits.at n=27A226468
• 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=5A317628
• a(n) = (3*n - 2)^2*(3*n - 1)/2.at n=33A386906