75092
domain: N
Appears in sequences
- "Ceiling of hypotenuses": a(n) = ceiling(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=1, a(2)=3.at n=42A104805
- For 1<=x<=n, 1<=y<=n, write gcd(x,y) = u*x+v*y with u,v minimal; a(n) = n^4*s, where s is the population variance of the values of u+v.at n=13A345724
- Number of integer partitions of n having a part that can be written as a nonnegative linear combination of the other (possibly equal) parts.at n=44A364913