2096896

Appears in sequences

• a(n) = 8^(n+1) - 2^(n+2).at n=6A020540
• Divisors of 33550336, the 5th perfect number.at n=21A133025
• Triangle read by rows: row n lists divisors of n-th perfect number A000396(n).at n=55A133031
• Divisors of 16775168 (half the 5th perfect number).at n=20A138815
• Triangle read by rows: row n lists the proper divisors of n-th perfect number A000396(n).at n=51A139246
• Triangle read by rows: row n lists the divisors of n-th perfect number A000396(n) that are multiples of n-th Mersenne prime A000668(n).at n=25A139247
• If an array is made of columns of -nacci sequences, fibo-, tribo- etc. all starting w. 1,1,2 etc, the NW to SE diagonals can be extended by computation. The above is diagonal 9. See A159741 for details.at n=13A159746
• Fibonacci 15-step numbers, a(n) = a(n-1) + a(n-2) + ... + a(n-15).at n=22A220493
• Non-unitary amicable numbers.at n=30A259037
• Larger of a non-unitary amicable pair.at n=15A259039
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 617", based on the 5-celled von Neumann neighborhood.at n=20A289939
• Nonunitary superperfect numbers: numbers k such that nusigma(nusigma(k)) = k, where nusigma(k) = sigma(k) - usigma(k) is the sum of nonunitary divisors of k (A048146).at n=34A329884
• Numbers that are either already perfect, or a perfect number is eventually reached if we start doubling them.at n=31A341622