-227

Appears in sequences

• Log of g.f. for rooted trees.at n=7A006900
• a(n) = floor(Sum_{k=0..n} tan(k)).at n=18A051508
• a(n) = round(Sum_{k=0..n} tan(k)).at n=29A051509
• a(n) = ceiling(Sum_{k=0..n} tan(k)).at n=14A051510
• a(n) = ceiling(Sum_{k=0..n} tan(k)).at n=27A051510
• a(n) = ceiling(Sum_{k=0..n} tan(k)).at n=29A051510
• a(n) = bin_prime_sum(fibonacci(A001651[n])), where fibonacci(A001651[n]) is A014437[n].at n=66A059878
• a(n) = floor(sin(n)*cos(2*n)^2*tan(4*n)^3).at n=30A062233
• Signed primes: if prime(n) even, a(n) = 0; if prime(n) == 1 (mod 4), a(n) = prime(n); if prime(n) == -1 (mod 4), a(n) = -prime(n).at n=48A073579
• a(n) = floor( prime(n-1)*A036263(n-2)/ A001223(n-1)).at n=47A094900
• Expansion of (1+x^2+x^4)/(1-x^6+x^7).at n=59A124751
• Inverse binomial transform of A131666 after removing A131666(0) = 0.at n=10A135258
• Sum of termwise product of mu(k) and reduced residue system k mod n.at n=49A143729
• Numerator of Bernoulli(n, 2/9).at n=4A158820
• a(0) = 1, a(1) = 2, a(3) = 3, a(n) = a(n-1) - a(n-3).at n=33A165192
• E.g.f. satisfies: A(x) = Sum_{n>=0} 1/n! * Sum_{k=0..n} (-1)^(n-k) * C(n,k) * (1 + x/A(x)^k)^k.at n=4A196958
• Primes or negative values of primes of the form 8*n^2 - 298*n + 2113 for n >= 0.at n=26A217439
• Primes or negative values of primes of the form 8*n^2 - 326*n + 2659 for n >= 0.at n=13A217440
• a(n) = 2^n - 243.at n=4A220089
• Expansion of the unique normalized cusp form of Gamma_0(5) of weight 6 in powers of q.at n=8A226347