22160

Appears in sequences

• Expansion of log(1+sin(x)/cosh(x)).at n=9A009342
• E.g.f. arctan(sec(x)*sinh(x)) (odd powers only).at n=4A012816
• Numbers whose base-3 representation has exactly 10 runs.at n=5A043590
• Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 9.at n=23A043807
• Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 10.at n=5A043815
• Binomial transform of number triangle A105632.at n=58A105848
• a(n) = Sum_{k=0..n} A109613(k)*A005843(n-k).at n=40A171218
• a(n) = A057641(A094348(n)).at n=32A181852
• Conjectured lower bounds for the Riemann hypothesis function floor(H(k) + exp(H(k))*log(H(k))) - sigma(k).at n=21A222761
• The number of binary pattern classes in the (2,n)-rectangular grid with 3 '1's and (2n-3) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=41A225972
• Numbers m such that each of p=6*m+1, q=6*p+1, r=6*q+1 and s=6*r+1 is prime.at n=27A263311
• Number of 2Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 2 or 4 neighboring 1s.at n=9A297695
• a(n) = 2*n*(7*n - 3).at n=40A316466
• Row sums of A337967.at n=8A337616
• First occurrence of difference n between two consecutive terms of A000404. a(n) gives the lower term. The upper term is A355238.at n=17A355237
• Triangle read by rows: T(n, k) = (-8)^k*binomial(2*n, 2*k)*Euler(2*k, 1/2).at n=14A371637