64339296875
domain: N
Appears in sequences
- Powers of 35.at n=7A009979
- a(n) = (2*n + 1)^7.at n=17A016759
- a(n) = (3n+2)^7.at n=11A016795
- a(n) = (4n+3)^7.at n=8A016843
- a(n) = (5*n)^7.at n=7A016855
- a(n) = (6*n + 5)^7.at n=5A016975
- a(n) = (7*n)^7.at n=5A016987
- a(n) = (8*n+3)^7.at n=4A017107
- a(n) = (9*n + 8)^7.at n=3A017263
- a(n) = (10*n + 5)^7.at n=3A017335
- a(n) = (11*n + 2)^7.at n=3A017419
- a(n) = (12*n + 11)^7.at n=2A017659
- Numbers whose prime factors are raised to the seventh power.at n=21A113852
- a(n) is the number of shapes of balanced trees with constant branching factor 7 and n nodes. The node is balanced if the size, measured in nodes, of each pair of its children differ by at most one node.at n=29A131893
- Expansion of (1 + 14*x)/(1 - 35*x^2).at n=14A182753
- T(n,k) = binomial(n,k)^n.at n=31A209427
- T(n,k) = binomial(n,k)^n.at n=32A209427
- Table T(n,k) = ((n+k-1)*(n+k-2)/2+n)^n, n,k >0 read by antidiagonals.at n=34A220416
- Numbers k = p_i^e_i * p_j^e_j such that i/e_i + j/e_j = 1 for e_i, e_j >= 1, p_i, p_j distinct prime numbers.at n=17A387978