-881

Appears in sequences

• a(n+1) = a(n) - n (if n is odd), a(n+1) = a(n) * n (if n is even).at n=9A047906
• Expansion of (1-x-x^N)/((1-x)(1-x^2)(1-x^3)...(1-x^N)) for N = 5.at n=39A060024
• Reflected (see A074058) pentanacci numbers A074048.at n=33A074062
• Expansion of (1-x-2*x^2)/(1-x^2+x^3).at n=29A109248
• Triangle T(n, k, q) = (1-q^n)*( binomial(n, k) - 1 ) + 1, with q = 2, read by rows.at n=23A174718
• Triangle T(n, k, q) = (1-q^n)*( binomial(n, k) - 1 ) + 1, with q = 2, read by rows.at n=25A174718
• Triangle T(n, k, q) = (1-q^n)*(1/k)*binomial(n-1, k-1)*binomial(n, k-1) - (1-q^n) + 1, for q = 2, read by rows.at n=16A174731
• Triangle T(n, k, q) = (1-q^n)*(1/k)*binomial(n-1, k-1)*binomial(n, k-1) - (1-q^n) + 1, for q = 2, read by rows.at n=19A174731
• a(n+1) = a(n-1) + 2 a(n-2) - a(n-4) ; a(0)=1, a(n)=0 for 0 < n < 5.at n=26A181560
• Alternating sum of centered heptagonal pyramidal numbers.at n=11A270694
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 483", based on the 5-celled von Neumann neighborhood.at n=23A272346
• Nearest integer to n^2*sin(n).at n=37A274087
• G.f.: A(x) = Sum_{n=-oo..+oo} (x - x^n)^n.at n=67A290003