23088

Appears in sequences

• a(n) = n*(2*n+5)*(2*n+7).at n=16A035329
• a(n) = 16*n*(n+2).at n=37A114444
• Triangle read by rows: expansion of Q(y, n), where Q(y,0)=1; Q(y,1)=y; Q(y, n) = -(-2 + 2*(1 - y) - 2*(1 - y)*Q(y, n - 1) + Q(y, n - 2)).at n=50A136202
• a(n) is the smallest unused number such that the RMS (Root Mean Square) of a(1) through a(n) is an integer.at n=33A141391
• Triangle, T(n, k) = A008517(n+1, k+1)*A008517(n+1, n-k+1), read by rows.at n=11A156529
• Triangle, T(n, k) = A008517(n+1, k+1)*A008517(n+1, n-k+1), read by rows.at n=13A156529
• a(n) = 64*n^2 - 16.at n=18A157913
• a(n) = 361*n^2 - 2*n.at n=7A158307
• Number of 3 X n 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.at n=40A229446
• Number of length n+6 0..1 arrays with at most two downsteps in every 6 consecutive neighbor pairs.at n=8A256814
• Expansion of Product_{k>=1} (1 - x^(8*k))/(1 - x^k).at n=39A261775
• a(n) = n*(n + 11)*(n + 22)*(n + 33)*(n + 44)/120.at n=4A264450
• Sum of the perimeters of all regions of the n-th section of a modular table of partitions.at n=27A278602
• Numbers k such that (397*10^k + 53)/9 is prime.at n=16A295627
• Sum of the sixth largest parts in the partitions of n into 7 parts.at n=50A308928
• E.g.f.: Product_{i>=1, j>=1} 1 / (1 - x^(i*j) / (i*j)!).at n=7A341505