-291

Appears in sequences

• a(n) = n^2 - primefloor(n)*primeceiling(n).at n=72A056139
• McKay-Thompson series of class 84a for Monster.at n=56A058761
• Expansion of (1-x-x^N)/((1-x)(1-x^2)(1-x^3)...(1-x^N)) for N = 4.at n=35A060023
• a(n+1) = a(n) - a(floor(n/2)), with a(0)=0, a(1)=1.at n=44A062187
• Expansion of (1-x)/(1 + 6*x - 3*x^2).at n=3A099842
• Expansion of x*(1+3*x-4*x^2-5*x^3-4*x^6+4*x^5+3*x^4) / ((1+4*x^2)*(1+x^2)*(1-x^2+x^4)).at n=8A112523
• Triangle built from partial sums of Catalan numbers multiplied by powers of nonpositive numbers.at n=32A112707
• Partial sums of Catalan numbers A000108 multiplied by powers of -4.at n=3A112711
• Output of Knuth's "man or boy" test for varying k.at n=12A132343
• Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of A203947.at n=51A203948
• G.f. satisfies: A(x) = 1/Product_{n>=1} (1 - x^n/A(x^n)^n).at n=32A205777
• Values of n such that L(1) and N(1) are both prime, where L(k) = (n^2+n+1)*2^(2*k) + (2*n+1)*2^k + 1, N(k) = (n^2+n+1)*2^k + n.at n=27A226921
• Expansion of Product_{k>=1} (1 + x^(8*k))/(1 + x^k).at n=53A261735
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 213", based on the 5-celled von Neumann neighborhood.at n=9A270904
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 245", based on the 5-celled von Neumann neighborhood.at n=9A271007
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 427", based on the 5-celled von Neumann neighborhood.at n=15A272110
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 501", based on the 5-celled von Neumann neighborhood.at n=9A272567
• Expansion of Product_{k>=1} (1 - x^k)^k/(1 - x^(4*k))^(4*k).at n=18A285284
• Signed recurrence over binary strict trees: a(n) = 1 - Sum_{x + y = n, 0 < x < y < n} a(x) * a(y).at n=30A300866
• Expansion of Product_{k>=1} (1 - Sum_{j>=1} j * x^(k*j)).at n=17A329157