63490

Appears in sequences

• Numbers k such that there are 10 digits in k^2 and for each factor f of 10 (1, 2, 5) the sum of digit groupings of size f is a square.at n=25A153748
• a(n) = 196*n^2 - 14.at n=17A158553
• Generating primitive Pythagorean triangles by using (n, n+1) gives perimeters for each n. This sequence lists the sum of these perimeters for each n triangles.at n=34A193068
• Number of length n+5 0..6 arrays with no consecutive six elements summing to more than 3*6.at n=0A242142
• T(n,k)=Number of length n+5 0..k arrays with no consecutive six elements summing to more than 3*k.at n=15A242144
• Number of length 1+5 0..n arrays with no consecutive six elements summing to more than 3*n.at n=5A242145
• Number of Dyck paths of semilength n such that the maximal number of peaks per level equals two.at n=10A288743
• Unitary abundant numbers k such that k+2 is also unitary abundant.at n=3A292704