45385

Appears in sequences

• a(n) = 2*n^4 + 2*n^3 + 3*n^2 + 2*n + 1.at n=12A058920
• 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=34A118471
• Number of 7Xn -1,1 arrays such that the sum over i=1..7,j=1..n of i*x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute n-across galley oarsmen left-right at 7 fore-aft positions so that there are no turning moments on the ship).at n=11A225347
• For every positive integer m, let u(m) = (d(1),d(2),...,d(k)) be the unitary divisors of m. The sequence (a(n)) consists of integers of the form d(k)/d(1) + d(k-1)/d(2) + ... + d(k)/d(1).at n=16A229999
• Numbers for which the root mean square of nontrivial divisors is an integer and which are not a square of prime numbers.at n=44A247137
• Triangle read by rows: Poincaré polynomials of orbifold of Fermat hypersurfaces.at n=32A281620
• a(n) = (n-1)*(n-2)*(n^2+9*n+12)/24.at n=31A323847
• Consecutive internal states of the linear congruential pseudo-random number generator (171*s + 11213) mod 53125 when started at 1.at n=13A385039