-231

Appears in sequences

• Bisection of A002470.at n=4A002286
• Glaisher's function W(n).at n=9A002470
• Triangle of Lehmer-Comtet numbers of the first kind.at n=40A008296
• a(n) = 5^n - n^8.at n=2A024057
• Triangle giving numerators of coefficients of Euler polynomials, highest powers first.at n=71A059341
• Expansion of (1-x-x^N)/((1-x)(1-x^2)(1-x^3)...(1-x^N)) for N = 5.at n=28A060024
• Numerator of coefficients of Euler polynomials (rising powers).at n=72A060096
• Determinant of the n X n matrix whose element (i,j) equals the (i-j)-th composite number, (j-i)-th prime number, or 1 if i=j.at n=3A071082
• Alternating sum of squares to n.at n=20A089594
• Generalized Stirling number triangle of first kind.at n=40A094646
• Generalized Stirling number triangle of first kind.at n=50A094646
• G.f. A(x) has the property that the first (n+1) terms of A(x)^(n+1) form the n-th row polynomial R_n(y) of triangle A097181 and satisfy R_n(1/2) = 8^n for all n>=0.at n=5A097182
• Expansion of 1/(1 - x + 4*x^2).at n=11A106853
• Expansion of a modular function for Gamma(7).at n=68A108482
• a(n) = sum( (-1)^(r+1)*(n-r)*r, r = 1..floor(n/2) ).at n=42A110422
• One fourth of fourth column (k=3) of triangle A111999.at n=1A112001
• Partial sums of (-1)^n*Fibonacci(n-1).at n=15A112469
• Sum(mu(i)*sigma(j): i+j=n), with mu=A008683 and sigma=A000203.at n=42A112964
• Integer k such that 10^n + k = A115062(n).at n=52A117190
• Number triangle T(n,k)=sum{i=0..n, (-1)^(n-i)*C(n,i)*sum{j=0..i-k, C(k,2j)*C(i-k,2j)}}.at n=62A119328