46576

Appears in sequences

• Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(2,15).at n=5A022026
• Multiplicity of highest weight (or singular) vectors associated with character chi_29 of Monster module.at n=42A034417
• Numbers k such that k!!!!!! + 1 is prime.at n=47A085150
• Triangle T(n,m) of the expansion coefficients of JacobiCN(x,y) + JacobiDN(x,y) = Sum_{n>=0} Sum_{k=0..n} (-1)^n*T(n,m)*x^(2*n)*y^(2*m)/(2*n)!.at n=17A171660
• Triangle T(n,m) of the expansion coefficients of JacobiCN(x,y) + JacobiDN(x,y) = Sum_{n>=0} Sum_{k=0..n} (-1)^n*T(n,m)*x^(2*n)*y^(2*m)/(2*n)!.at n=18A171660
• G.f. satisfies: A(x) = Product_{n>=1} (1 + x^n*A(x)^(n^2)).at n=8A192784
• Expansion of (x-5*x^2+11*x^3-12*x^4+7*x^5-2*x^6+x^7) / (1-6*x+15*x^2-20*x^3+15*x^4-6*x^5+x^6).at n=25A221948
• Array read by antidiagonals: T(m,n) is the number of acyclic spanning subgraphs in the grid graph P_m X P_n.at n=22A360194
• Array read by antidiagonals: T(m,n) is the number of acyclic spanning subgraphs in the grid graph P_m X P_n.at n=26A360194
• Number of mutual-visibility sets in the n X 3 grid graph.at n=8A392419