35200

Appears in sequences

• Expansion of Jacobi theta constant (theta_2/2)^16.at n=7A014805
• Number of k's such that A002034(k) = n.at n=21A038024
• Numbers k such that 1*k + 1, 3*k + 1, 9*k + 1, 27*k + 1 are all primes.at n=29A112041
• n! in base 6.at n=7A127113
• A triangle sequence from polynomial coefficients: p(x, n) = (4*(n - 1) + (4(n - 1))*x^2)*p(x, n - 1) + 2*(n - 1)x^2*p(x, n - 2).at n=27A156817
• A triangle sequence from polynomial coefficients: p(x, n) = (4*(n - 1) + (4(n - 1))*x^2)*p(x, n - 1) + 2*(n - 1)x^2*p(x, n - 2).at n=33A156817
• Partial sums of floor(n^3/3).at n=25A173707
• a(n) = Sum_{d|n} A007955(d) * A000027(n/d) = Sum_{d|n} A007955(d) * (n/d), where A007955(m) = product of divisors of m.at n=31A174932
• Numbers with prime factorization pq^2r^7.at n=12A190466
• a(n) = 22*n^2.at n=40A195323
• Number of (n+1) X (1+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).at n=8A235271
• Number of (n+1) X (9+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).at n=0A235279
• T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).at n=36A235280
• a(n) = (4*n+8)*n^2.at n=20A258617
• Expansion of Product_{k>=0} 1/(1-x^(5*k+4))^(5*k+4).at n=47A285132
• Number of unordered pairs of disjoint self-avoiding paths with nodes that cover all vertices of a convex n-gon; one node paths are not allowed.at n=10A308914
• Numbers 4*k such that 1 is the last integer obtained when 4*k is successively divided by its divisors in increasing order.at n=35A329549
• a(n) is the number of distinct resistances that can be produced using at most n unit resistors in a planar network.at n=12A340921
• Irregular triangle T(n,k) read by rows in which n-th row lists in colex order all series-reduced tree degree sequences D of n nodes encoded as t = Product_{d in D} prime(d); n >= 4, 1 <= k <= A002865(n-2).at n=18A345970
• Smallest k such that A349410(k) = n or -1 if no such number exists.at n=12A349428