86016

Appears in sequences

• Numbers j such that sigma(sigma(j)) = k*j for some k.at n=37A019278
• 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 (2,6)-perfect numbers.at n=5A019283
• Denominator of Bernoulli(2n,1/4).at n=3A033475
• First differences of A045891.at n=16A034007
• Dirichlet convolution of Ramanujan numbers (A000594) with themselves.at n=15A034778
• Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*4^j.at n=33A038210
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*4^j.at n=34A038222
• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*2^j.at n=30A038232
• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*3^j.at n=29A038233
• Odd powers of 2 multiplied by Catalan numbers.at n=6A052707
• Invert transform applied three times to Pascal's triangle A007318.at n=30A055374
• Invert transform applied three times to Pascal's triangle A007318.at n=33A055374
• Order of automorphism group of the group C_n X C_n X C_n (where C_n is the cyclic group of order n).at n=3A064767
• Number of invertible n X n matrices mod 4 (i.e., over the ring Z_4).at n=3A065128
• 14-almost primes (generalization of semiprimes).at n=8A069275
• a(1) = 1; a(n) is the smallest multiple of a(n-1) not divisible by 10 which is greater than the digit reversal of a(n-1). In case R(a(n-1)) < a(n-1) then a(n) = 2*a(n-1).at n=12A076086
• Binomial transform of A001651.at n=13A084858
• Let A(n) be the matrix in the group GL(n,2) such that for 1 <= i, j <= n: A[i,j] = 1 if i+j = n+1 A[i,j] = 0 if i+j != n+1. a(n) is the size of the centralizer of A(n) in GL(n,2).at n=5A087540
• XOR difference triangle, read by rows, of A099898 (in leftmost column) such that the main diagonal equals A099898 shift left and divided by 4.at n=41A099897
• Second differences of A045623, prefixed by an initial 1.at n=15A109975