-223

Appears in sequences

• Expansion of e.g.f.: exp(sin(sinh(x))).at n=7A009202
• a(n) = ceiling(Sum_{k=0..n} tan(k)).at n=23A051510
• a(n) = ceiling(Sum_{k=0..n} tan(k)).at n=20A051510
• Signed distance of primes from LCM(1,...,x) being closest to it. Arguments x were selected from A000961 (powers of primes including primes) in order to use distinct values of LCM exactly once. When both closest primes are in the same distance, then negative were used.at n=57A058030
• a(n) = bin_prime_sum(fibonacci(A001651[n])), where fibonacci(A001651[n]) is A014437[n].at n=50A059878
• 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=47A073579
• Expansion of q^(1/24) * eta(q) / eta(q^2) in powers of q.at n=61A081362
• a(n+3) = 2a(n+2) - 3a(n+1) + 2a(n); a(0) = 1, a(1) = 3, a(2) = 4.at n=15A105579
• Expansion of (1 - x + 2*x^2) / (1 - x^3 + x^4).at n=37A110062
• Triangle read by rows: T[n, m] = Sum[m^3 - 3*m^2*k + 3*m*k^2 - k^3, {k, 0, n - 1}] + m^4.at n=29A121721
• {a(k)} is such that, for every positive integer n, the n-th prime = Sum_{k=1..n, gcd(k,n+1)=1} a(k).at n=47A126761
• {a(k)} is such that, for every positive integer n, the n-th prime = Sum_{k=1..n, gcd(k,n+1)=1} a(k).at n=53A126761
• Expansion of q^(-3/8)* eta(q)^7* eta(q^4)^2/ eta(q^2)^3 in powers of q.at n=28A128713
• Row sums of triangle A136502.at n=5A136504
• Expansion of (1-5*x-x^2+x^3)/((1+x)*(1-x)^3).at n=14A141354
• Expansion of quotient of a Ramanujan false theta series by the theta series of triangular numbers in powers of x.at n=27A143065
• Numerator of Hermite(n, 13/28).at n=2A160196
• Numerator of Hermite(n, 17/32).at n=2A160398
• A symmetrical triangle sequence: q=1;t(n,m,q)=If[q == 1, Binomial[n, m] + Eulerian[n + 1, m] - Binomial[n, m]*Eulerian[n + 1, m], (q - 1) + Binomial[n, m]^q + Eulerian[n + 1, m]^q - q*Binomial[n, m]*Eulerian[n + 1, m]].at n=19A174966
• A symmetrical triangle sequence: q=1;t(n,m,q)=If[q == 1, Binomial[n, m] + Eulerian[n + 1, m] - Binomial[n, m]*Eulerian[n + 1, m], (q - 1) + Binomial[n, m]^q + Eulerian[n + 1, m]^q - q*Binomial[n, m]*Eulerian[n + 1, m]].at n=16A174966