62523502209
domain: N
Appears in sequences
- a(n) = (4*n + 3)^6.at n=15A016842
- a(n) = (5n+3)^6.at n=12A016890
- a(n) = (6*n + 3)^6.at n=10A016950
- a(n) = (7*n)^6.at n=9A016986
- a(n) = (8*n + 7)^6.at n=7A017154
- a(n) = (9*n)^6.at n=7A017166
- a(n) = (10*n + 3)^6.at n=6A017310
- a(n) = (11*n + 8)^6.at n=5A017490
- a(n) = (12*n + 3)^6.at n=5A017562
- Number of n X n binary matrices with no zero rows.at n=6A055601
- Triangle read by rows: T(n,k) = (2^k - 1)^n, 1<=k<=n.at n=20A092477
- If b(n) is the smallest positive integer and c(n) is the largest positive integer such that n = b(n)^c(n), then a(n) = b(n)^c(n+1).at n=62A112537
- a(n) = sigma(n)^tau(n), where tau(n) = A000005(n) = the number of divisors of n and sigma(n) = A000203(n) = the sum of divisors of n.at n=31A236287
- Triangle read by rows: T(n, k) = Sum_{i=1..n-k} qStirling1(n-k, i) * qStirling2(n-1+i, n-1) for 0 < k < n with initial values T(n, 0) = 0^n and T(n, n) = 1 for n >= 0, here q = 2.at n=29A355282