32376

Appears in sequences

• Phi(A033631(n)) {phi is the Euler totient function A000010}.at n=17A115620
• a(n) = 49n^2 - 28n - 20.at n=25A118058
• a(n) = n*(n+2)*(2*n-1)/3. Also, row sums of triangle A131422.at n=35A131423
• Triangle, read by rows, where T(n,k) = [(I + D*C)^n](n,k); that is, row n of T = row n of (I + D*C)^n for n>=0 where C denotes Pascal's triangle, I the identity matrix and D a matrix where D(n+1,n)=1 and zeros elsewhere.at n=49A134090
• Duplicate of A131423.at n=35A143371
• Number of permutations of floor(i*5/4), i=0..n-1, with all sums of 5 adjacent terms unique.at n=7A152355
• a(n) = 225*n^2 - 2*n.at n=11A158226
• Sums of 4 distinct primorials.at n=30A177709
• Number of n X 5 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 n X 5 array.at n=27A219499
• a(n) = 4*(n + 1)*(n + 2)*(4*n + 3)/3.at n=17A267522
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 107", based on the 5-celled von Neumann neighborhood.at n=35A270166
• Composite k that divides 2^(k-2) + 3^(k-2) + 6^(k-2) - 1.at n=36A318761
• G.f.: Sum_{n>=0} (n+1)*(n+2)*(n+3)/3! * (x + x^n)^n.at n=35A325999
• Triangle read by rows: T(n, k) = n! * 2^k * hypergeom([-k], [-n], -1/2).at n=31A374427