37225

Appears in sequences

• a(n) = n + max_{0 <= i <n} ((n-i)*a(i)), a(0) = 1.at n=25A008609
• Least x = a(n) such that sum of common prime divisors (without multiplicity) of sigma(x) and phi(x) equals n, or 0 if such number (apparently) does not exist.at n=37A082056
• Number of (n+1) X (6+1) arrays of permutations of 0..n*7+6 with each element having directed index change -2,0 -1,0 0,-1 or 1,1.at n=4A264626
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change -2,0 -1,0 0,-1 or 1,1.at n=49A264628
• Number of (5+1)X(n+1) arrays of permutations of 0..n*6+5 with each element having directed index change -2,0 -1,0 0,-1 or 1,1.at n=5A264632
• Numbers m such that the decimal number concat(8,m) is a square.at n=37A273363
• a(n) = n! * [x^n] exp(n*x/(1 - x)).at n=5A293145
• Total number of 0's in all (binary) max-heaps on n elements from the set {0,1}.at n=20A309051