6635520

Appears in sequences

• Denominators of Bernoulli polynomials B(n)(x).at n=14A001898
• Euler totient function (A000010) of 2^n - 1.at n=23A053287
• Array T(i,1)=i, T(1,j)=j and T(i,j)=T(i-1,j-1)*T(i,j-1) read by antidiagonals.at n=38A085916
• Number of divisors of the n-th superior highly composite number.at n=30A098895
• Number of divisors of A138113(n).at n=30A140410
• Numbers that set records for number of ordered factorizations as A025487(j)*A025487(k).at n=29A182763
• Number of spanning trees in the n-crown graph.at n=3A193133
• Sorted number of edges of distinct solutions in the mix of 2 or 3 regular convex 4-polytopes.at n=23A199808
• a(n) is the LCM of denominators of polynomials of degree n which are integer-valued on primes together with their first divided differences.at n=10A212429
• Denominators of higher order Bernoulli numbers.at n=7A213449
• Numbers which have identical primes in n and d(n) but are not refactorable.at n=14A235525
• Triangle read by rows: T(n,L) = number of rho-labeled graphs with n edges whose labeling is bipartite with boundary value L.at n=33A255908
• Triangle read by rows: number of spanning trees obtained for an almost-complete bipartite graph by removing k disjoint edges from the complete bipartite graph K n,n with k<=n.at n=20A260383
• Number of nX2 arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 4.at n=7A264636
• a(n) = phi(4^n-1), where phi is Euler's totient function (A000010).at n=11A295501
• Irregular triangular array, read by rows: row n shows the coefficients of the polynomial p(n,x) defined in Comments.at n=16A329441
• a(n) = Product_{k=1..n} d(2*k), where d() is the number of divisors function A000005.at n=10A334767
• Product of the digits of 3^n.at n=24A358271
• a(n) = phi(8^n-1), where phi is Euler's totient function (A000010).at n=7A366654
• a(n) is phi(n^n-1) where phi is the Euler totient function.at n=6A366821