45370

Appears in sequences

• a(0)=1. a(n) = a(n-1)*(n+1), if n is in the sequence. a(n)= a(n-1) +1, if n is missing from the sequence.at n=19A118471
• Number of strings of numbers x(i=1..7) in 0..n with sum i^2*x(i)^3 equal to 49*n^3.at n=39A184322
• Numbers of the form m^2 + 1 that can be expressed in more than one way as j^2 + k^2 with j > k > 1 and gcd(j,k) = 1.at n=28A300166
• a(n) = A293564(n) - 1.at n=11A308988