136080

Appears in sequences

• Number of ways of writing n as a sum of 7 squares.at n=35A008451
• n is equal to the number of 4s in all numbers <= n written in base 6.at n=14A014892
• Numbers m such that uphi(sigma(m)) = 2m, where the unitary phi function (A047994) is defined by: if x = p1^r1*p2^r2*p3^r3*... then uphi(x) = (p1^r1 - 1)*(p2^r2 - 1)*(p3^r3 - 1)*...at n=14A030165
• Number of strings of n distinct digits from 0-9 that are the last n digits of a square in base 9.at n=7A036753
• Number of strings of n distinct digits from 0-9 that are the last n digits of a square in base 9.at n=8A036753
• Triangle read by rows: T(n, k) = [x^k] x*Pochhammer(n + x, n)/(n + x).at n=41A038455
• Triangle T(n,k) of n X n binary matrices with k=0..n^2 ones under action of dihedral group of the square D_4.at n=43A054252
• Triangle T(n,k) of n X n binary matrices with k=0..n^2 ones under action of dihedral group of the square D_4.at n=52A054252
• Denominators of Maclaurin series coefficients for 2*cos(x/sqrt(3) + arctan(-sqrt(3))) = cos(x/sqrt(3)) + sqrt(3)*sin(x/sqrt(3)).at n=7A059944
• Number of rods required to make a 3-D cube of side length n.at n=35A059986
• Number of n-digit positive integers with all digits distinct.at n=5A073531
• Triangle with T(n,k)=n!*(k-1)^k/k! where 1<=k<=n.at n=31A076482
• Triangle read by rows: T(n,k) is the number of permutations p of [n] in which the length of the longest initial segment avoiding both the 132- and the 321-pattern is equal to k.at n=38A092741
• Hook products of all partitions of 12.at n=14A093791
• Hook products of all partitions of 12.at n=13A093791
• Gives the i-th coefficient M(k,i) of the decomposition of the polynomials B(k,X^2) in the basis of all B(i,X), where B(i,X) is the i-th binomial polynomial: B(i,X) = X(X-1)...(X-i+1)/i! for any i > 0 and B(0,X) = 1 by definition.at n=34A100344
• Triangle T(n,k) of number of labeled directed multigraphs (with loops), without isolated vertices, with n arrows and k vertices (n = 1,2,.., k = 1..2*n).at n=28A120945
• Rectangular array read by antidiagonals: a(n, k) is the number of ways to put k labeled objects into n labeled boxes so that there are exactly two boxes with exactly one object (n, k >= 2).at n=51A131105
• Triangle of the coefficient [x^k] of the polynomial 2^n*s_n(x) generated by exp(x*(1 - sqrt(1+t^2))/t) = Sum_{n>=0} s_n(x)*t^k/k! in row n, column k.at n=61A137378
• Triangle of coefficients associate with the expansion of the K_3 graph matric characteristic polynomial as a Sheffer sequence: M = {{0, 1, 1}, {1, 0, 1}, {1, 1, 0}} f(t)=-t^3+3t+2 p(x,t)=1/(2*t^3+3*t^2-1)^x=1/(t^3*f(1/t))^x.at n=18A137946