33792
domain: N
Appears in sequences
- Bisection of A002470.at n=16A002287
- Glaisher's function W(n).at n=32A002470
- Numbers that are the sum of 2 positive 5th powers.at n=31A003347
- Numbers that are the sum of at most 2 positive 5th powers.at n=40A004842
- a(n) = n^2*(n+1).at n=32A011379
- Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (4,k)-perfect numbers.at n=52A019293
- Denominator of Bernoulli(2n,1/2).at n=5A033469
- Numbers having four 0's in base 8.at n=29A043424
- a(n) = 2^(n-2)*binomial(n+1,2).at n=9A052482
- Number of points in N^7 of norm <= n.at n=6A055406
- Number of points in N^n of norm <= 6.at n=7A055421
- Expansion of (1+3*x+4*x^2)/(1-4*x^2+4*x^4).at n=21A058582
- a(n) = 4^n + 8^n.at n=5A063481
- a(n)=phi(n^2+1)/n if (n^2+1) is composite and phi(n^2+1)==0 (mod n).at n=39A067926
- 12-almost primes (generalization of semiprimes).at n=15A069273
- Sequence associated with a(n) = 2*a(n-1) + k*(k+2)*a(n-2).at n=10A080929
- Numbers of form x^5 + y^5, x,y > 0 and x <> y.at n=24A088703
- a(1)=1, a(n) = n*a(floor(n/2)).at n=32A098844
- Triangle read by rows: T(n,k) is the number of binary trees with n edges and jump-length equal to k (n >= 0, 0 <= k <= n-2).at n=51A127532
- Triangle read by rows: the coefficients of the Mittag-Leffler polynomials.at n=38A137513