-173

Appears in sequences

• a(n) = prime(n)-n*tau(n) where tau(n) is the number of divisors of n.at n=35A067292
• A measure of how close the square root of 2 is to rational numbers.at n=49A068515
• Partial sums of A073579.at n=31A077039
• Partial sums of A073579.at n=43A077039
• Expansion of 1/(1+x+x^2+2*x^3).at n=19A077976
• a(n) = 1/2 + (1-6*n)*(-1)^n/2.at n=58A084060
• G.f. A(x) defined by: A(x)^10 consists entirely of integer coefficients between 1 and 10 (A083950); A(x) is the unique power series solution with A(0)=1.at n=4A084210
• Numerators of terms in series expansion of arctan(arcsin(x)).at n=3A096719
• Expansion of -(3 - x + 2*x^2) / (1 - x^3 + x^4).at n=37A110063
• Expansion of (1-x+x^2)/((x^2+x+1)*(x^2+5*x+1)).at n=3A110310
• Sequence is {a(5,n)}, where a(m,n) is defined at sequence A111518.at n=9A111523
• Y = X = 'i + .25(ii + jj + kk + e); Z = 'i - i' + .5(jj + kk - jk + kj) + e. See pdf-file and comment for an exact definition (this sequence gives an initial term 3); Version "les".at n=42A119954
• Binomial centered tridigonal matrices as a triangular sequence: t(n,m.d)=If[n + m - 1 == d, binomial[d - 1, n - 1], If[n + m == d, -1, If[n + m - 2 == d, -1, 0]]].at n=16A124030
• Inverse binomial transform of the Moebius sequence {mu(k), k >= 1}, A008683.at n=8A124839
• Triangle, row sums = A008683, the Mobius sequence.at n=44A124840
• Expansion of x*(4+9*x-7*x^2) / ((1-x)*(1+3*x-x^2)).at n=5A134250
• Expansion of (1-x+sqrt(1-2x+5x^2))/(2(1-x)^2).at n=12A134920
• Triangle read by rows : T(n,0) = n+1, T(n,k)=0 if k<0 or if k>n, T(n,k) = k*T(n-1,k) - T(n-1,k-1).at n=33A159881
• Triangle T(n,k) = A006130(k) - A006130(n) + A006130(n-k) read by rows.at n=30A176261
• Triangle T(n,k) = A006130(k) - A006130(n) + A006130(n-k) read by rows.at n=33A176261