36096

Appears in sequences

• Expansion of log(1+sinh(tanh(x))).at n=10A009349
• tanh(arcsin(arcsinh(x)))=x-2/3!*x^3+24/5!*x^5-664/7!*x^7+36096/9!*x^9...at n=4A012118
• Numbers k such that 4*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=17A056708
• Ordered factorizations over hook-type prime signatures with exactly three distinct primes (third column of A098348).at n=8A098385
• Triangular product sequence based 2^n times the Fibonacci version and 4 replaced with m: t(m,n)=2^n*Product[(1 + m*Cos[k*Pi/n]^2), {k, 1, Floor[(n - 1)/2]}].at n=63A152036
• Number of permutations of 0..n-1 with all sums of 6 adjacent terms unique.at n=7A152369
• Number of permutations of floor(i*9/8), i=0..n-1, with all sums of 6 adjacent terms unique.at n=7A152387
• The EG1 triangle.at n=12A162005
• Third left hand column of the EG1 triangle A162005.at n=2A162007
• Third right hand column of the EG1 triangle A162005.at n=2A162008
• Numbers of the form p^8*q*r where p, q, and r are distinct primes.at n=22A179747
• Consider the list s(1), s(2), ... of numbers that are products of exactly n primes; a(n) is the smallest s(j) whose decimal expansion ends in j.at n=10A186000
• Number of scalene triangles on an n X n grid (or geoboard).at n=7A190312
• Composites whose prime factorization in base 5 is an anagram of the number in base 5.at n=19A260049
• a(n) = ((1 + sqrt(11))^n - (1 - sqrt(11))^n)/sqrt(11).at n=8A274526
• Numbers that are the product of exactly 10 primes and are of the form prime(n) + prime(n + 1).at n=16A281927
• Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1<=k<=m positions can be picked in an m X m square grid such that the picked positions don't have any symmetry.at n=30A292152
• Sum of the fourth largest parts in the partitions of n into 8 parts.at n=46A308995
• E.g.f.: S(x,k) = Integral C(x,k)*D(x,k)^2 dx, such that C(x,k)^2 - S(x,k)^2 = 1, and D(x,k)^2 - k^2*S(x,k)^2 = 1, as a triangle of coefficients read by rows.at n=12A322230
• E.g.f.: S(x,k) = -i * sn( i * Integral C(x,k) dx, k) such that C(x,k) = cn( i * Integral C(x,k) dx, k), where S(x,k) = Sum_{n>=0} Sum_{j=0..n} T(n,j) * x^(2*n+1)*k^(2*j)/(2*n+1)!, as a triangle of coefficients T(n,j) read by rows.at n=12A325220