23055

Appears in sequences

• tan(tan(x)-sin(x)) = 3/3!*x^3 + 15/5!*x^5 + 273/7!*x^7 + 23055/9!*x^9...at n=4A013353
• Numbers k such that 2*10^k + 3*R_k + 6 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=18A102951
• Number of connected (4,n)-hypergraphs (without empty edges and without multiple edges).at n=5A114933
• Integers of the form 4n+3 for which Sum_{i=1..u} J(i,4n+3) obtains value zero exactly 7 times, when u ranges from 1 to (4n+3). Here J(i,k) is the Jacobi symbol.at n=28A166057
• Numbers k such that there is 1 prime between 100*k and 100*k + 99.at n=26A186393
• Let F(x) = 1 + 1*x + 4*x^2 + 10*x^3 + ..., the g.f. for A000293 (solid partitions), and write F(x) = 1/Product_{n>=1} E(n)^a(n) where E(n) = Product_{k>=n} (1 - x^(n*k)).at n=22A193718
• Number of nX4 0..2 arrays with no element less than a strict majority of its horizontal, diagonal and antidiagonal neighbors.at n=2A232277
• T(n,k)=Number of nXk 0..2 arrays with no element less than a strict majority of its horizontal, diagonal and antidiagonal neighbors.at n=17A232281
• Number of 3Xn 0..2 arrays with no element less than a strict majority of its horizontal, diagonal and antidiagonal neighbors.at n=3A232283
• a(n) = Sum_{1 <= i <= j <= k <= n} gcd(i,j,k).at n=44A344521