48896

Appears in sequences

• Denominators of continued fraction convergents to sqrt(857).at n=14A042655
• Coefficients c[r,n] in Schmidt's problem Sum[Binomial[n,k]^r Binomial[n+k,k]^r,{k,0,n}] == Sum[Binomial[n,k]Binomial[n+k,k]c[r,k],{k,0,n}] for r=4.at n=3A092868
• Array read by antidiagonals: Solutions to Schmidt's Problem.at n=24A094424
• Relates row sums of Pascal's triangle to expansion of cos(x)/exp(x).at n=15A100216
• Let M0 = {{2, 2, 0}, {1, 0, 1}, {0, 2, 2}}; M1 = {{1, 0, 1}, {2, 2, 0}, {0, 2, 2}}; M2 = {{2, 2, 0}, {0, 2, 2}, {1, 0, 1}}; M[n_] := M[n] = If[Mod[v[n][[1]], 3] == 0, M1, If[Mod[v[n][[2]], 3] == 0, M0, M2]] v[0] = {1, 1, 1}; M[0] = {{2, 2, 0}, {1, 0, 1}, {0, 2, 2}}; v[n_] := v[n] = M[n - 1].v[n - 1]. Then a(n) =v[n][[1]].at n=9A115106
• a(n) = 2^n*tetranacci(n) or (2^n)*A001648(n).at n=7A127216
• a(n) = 2*a(n-1) + 2*a(n-2) - 4*a(n-3) with n>2, a(0)=0, a(1)=1, a(2)=3.at n=15A135094
• a(n) = (3*2^n - 2) * 2^n.at n=7A165665
• Expansion of (2/Pi)*elliptic_E(k) in powers of q.at n=12A194094
• Number of 2 X 2 nonsingular matrices having all terms in {-n,...,0,...,n}.at n=6A211149
• a(n) = 2*n^4 - floor(2^(1/4)*n)^4.at n=24A257854
• Sum over all partitions of n into distinct parts of the bitwise XOR of the parts.at n=47A306925
• a(0)=0, a(1)=1; and a(n) = {2*a(n-2), 2*a(n-1)}, where {x,y} is the concatenation of x and y.at n=5A334025
• a(n) = A341886(n)/2; numbers k such that A307437(k) is even.at n=10A341887
• Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = Sum_{1 <= x_1, x_2, ..., x_k <= n} gcd(x_1, x_2, ..., x_k, n)^k.at n=48A372938
• Numbers k such that sigma(k) = psi(k) + phi(k) + omega(k)^6.at n=0A391949