32704

Appears in sequences

• 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 (3,k)-perfect numbers.at n=22A019292
• a(n) = 8^(n+1) - 2^(n+2).at n=4A020540
• Expansion of 1/(1 - 32*x + x^2).at n=3A029548
• Denominators of continued fraction convergents to sqrt(255).at n=7A041479
• Number of non-unitary but squarefree divisors of n!. Also number of unitary but not-squarefree divisors of n!.at n=46A056675
• Number of non-unitary but squarefree divisors of n!. Also number of unitary but not-squarefree divisors of n!.at n=47A056675
• Number of non-unitary but squarefree divisors of n!. Also number of unitary but not-squarefree divisors of n!.at n=48A056675
• Number of non-unitary but squarefree divisors of n!. Also number of unitary but not-squarefree divisors of n!.at n=49A056675
• a(0) = 1; for n>0, a(n) = 16 times sum of cubes of divisors of n.at n=12A092820
• Numbers whose set of base 8 digits is {0,7}.at n=28A097254
• a(n) = 10 + floor(Sum_{j=1..n-1} a(j) / 2).at n=20A120138
• a(n) = 2*4^n + (-1)^n*2^(n-1).at n=6A120470
• Binomial transform of abs(A134967).at n=13A135035
• a(n) = n^5 - n^2.at n=8A135497
• Chebyshev polynomial of the second kind U(3,n).at n=16A144138
• a(n) = 6*a(n-1) - 8*a(n-2) for n > 1; a(0) = 7, a(1) = 30.at n=6A171472
• a(n) = 64*(2^n - 1).at n=9A175166
• Monotonic ordering of nonnegative differences 2^i - 8^j, for 40 >=i >= 0, j >= 0.at n=43A192120
• Monotonic ordering of nonnegative differences 8^i - 2^j, for 40 >= i >= 0, j >= 0.at n=39A192121
• Monotonic ordering of nonnegative differences 8^i-4^j, for 40>= i>=0, j>=0.at n=21A192168