110143

Appears in sequences

• a(n) = (F(6*n+3) - 2)/32, where F = A000045 (the Fibonacci sequence).at n=5A049664
• Denominator of 2*Sum(C(n,w)/(2*w+1),w=0..n/2-1)+C(n,n/2)/(n+1) if n is even, or of 2*Sum(C(n,w)/(2*w+1),w=0..(n-1)/2) if n is odd.at n=30A085569
• Concatenation of even n and odd n-th nonprime.at n=23A155492
• Triangle T(n,m) = coefficient of x^n in expansion of (1/2-1/2*(1-8*x)^1/4)^m = sum(n>=m, T(n,m) x^n), n>=1, m>=1.at n=49A202039
• Array: T(m,n) = (F(m) + F(2*m) + ... + F(n*m))/F(m), by antidiagonals, where F = A000045 (Fibonacci numbers).at n=50A214984
• Array: T(m,n) = (F(n) + F(2*n) + ... + F(n*m))/F(n), by antidiagonals; transpose of A214984.at n=49A214985
• Logarithmic derivative of the hyperfactorials (A002109).at n=3A219267
• a(n) appears in the congruences modulo 4 or 32 of Markoff numbers m(n) = A002559(n) for odd or even m(n).at n=49A309376
• 4-brilliant numbers with distinct prime factors.at n=17A376864