25507

Appears in sequences

• a(0) = 1, a(n) = 1 + 2*3 + 4*5 + 6*7 + ... + (2n)*(2n+1) for n > 0.at n=26A098931
• Expansion of g.f. (1/2)*( a*(1+x)^n + b*(1-x)^(n+2)*LerchPhi(x, -n-1, 1) + c*2^(n+1)*(1-x)^(n+1)*LerchPhi(x, -n, 1/2) ), where a = 31, b = -59, and c = 15, read by rows.at n=29A168549
• Expansion of g.f. (1/2)*( a*(1+x)^n + b*(1-x)^(n+2)*LerchPhi(x, -n-1, 1) + c*2^(n+1)*(1-x)^(n+1)*LerchPhi(x, -n, 1/2) ), where a = 31, b = -59, and c = 15, read by rows.at n=34A168549
• Numbers n such that n!3 + 3^5 is prime, where n!3 = n!!! is a triple factorial number (A007661).at n=31A247868
• L.g.f.: Sum_{n=-oo..+oo} (x - x^(2*n-1))^(2*n-1) / (2*n-1).at n=54A293129
• a(n) = Sum_{d|n} (-1)^omega(n/d) * phi(rad(n/d)) * p(d), where p = A000041 (partition numbers).at n=37A333697
• a(n) is the number of reducible monic cubic polynomials x^3 + r*x^2 + s*x + t with integer coefficients bounded by naïve height n (abs(r), abs(s), abs(t) <= n).at n=41A358398
• Number of integer partitions of n that are not of length 2 and do not contain n/2.at n=38A365825
• a(0) = 33. a(n) = 3*a(n-1) + 2*n + 1 for n >= 1.at n=6A370481