-2555

Appears in sequences

• Numerators of cosecant numbers -2*(2^(2*n - 1) - 1)*Bernoulli(2*n); also of Bernoulli(2*n, 1/2) and Bernoulli(2*n, 1/4).at n=5A001896
• Duplicate of A001896.at n=5A033474
• G.f. satisfies: A(x) = 1/(1 + x*A(x^7)) and also the continued fraction: 1 + x*A(x^8) = [1; 1/x, 1/x^7, 1/x^49, 1/x^343, ..., 1/x^(7^(n-1)), ...].at n=39A101917
• Row sums of number triangle related to the Jacobsthal numbers.at n=36A110325
• Expansion of 8 * eta(q)^7 / eta(q^7) + 49 * (eta(q) * eta(q^7))^3 in powers of q.at n=18A138809
• Numerator of Bernoulli(n, 1/2).at n=10A157779
• Numerator of Bernoulli(n, 1/4).at n=10A157817
• a(2n)=A001896(n). a(2n+1)=(-1)^n*A110501(n+1).at n=10A225825
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 313", based on the 5-celled von Neumann neighborhood.at n=29A271203
• Triangle read by rows, defined by Riordan's general Eulerian recursion: T(n, k) = (k+3)*T(n-1, k) + (n-k-2) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-2)^(n-1).at n=43A306547
• T(n, k) = numerator([x^k] b_n(x)), where b_n(x) = Sum_{k=0..n} binomial(n,k)* Bernoulli(k, 1/2)*x^(n-k). Triangle read by rows, for n >= 0 and 0 <= k <= n.at n=55A335947
• T(n, k) = numerator([x^k] b_n(x)), where b_n(x) = Sum_{k=0..n} binomial(n,k)*2^k* Bernoulli(k, 1/2)*x^(n-k). Triangle read by rows, for n >= 0 and 0 <= k <= n.at n=55A335953
• T(n, k) = numerator([x^k] b(n, x)), where b(n, x) = 2^n*Sum_{k=0..n} binomial(n, k) * Bernoulli(k, 1/2) * x^(n-k). Triangle read by rows, for 0 <= k <= n.at n=55A336517
• E.g.f. A(x) satisfies A(A(A(A(A(x))))) = x * exp(5*x).at n=5A372745