128768

Appears in sequences

• 2^n*(2^(n+1) - n - 1).at n=8A008353
• Numbers k such that sigma(k) == 8 (mod k).at n=12A045770
• Sum{T(i,n-i): i=0,1,...,n}, array T as in A047140.at n=18A047141
• Winning binary "same game" templates of length n as defined below.at n=16A066345
• Numbers k with abundance radius of 8, i.e., abs(sigma(k)-2*k) = 8.at n=18A088820
• Numbers k whose abundance is 8: sigma(k) - 2*k = 8.at n=8A088833
• Triangle, read by rows, where row n equals the inverse binomial transform of the crystal ball sequence for D_n lattice.at n=54A108556
• Admirable Harshad numbers such that the subtracted divisor is also a Harshad number.at n=29A109396
• Admirable numbers whose abundance is < 10.at n=22A109788
• Admirable numbers such that the subtracted divisor is square.at n=22A109806
• Abundant numbers n such that n/(sigma(n)-2n) is an integer.at n=36A153501
• 9th column of the array A172119.at n=17A172318
• (2*n-1)-perfect numbers.at n=1A175853
• Abundant numbers n for which the abundance d = sigma(n) - 2*n is a proper divisor, that is, 0 < d < n and d | n.at n=34A181595
• Numbers m with divisor 8 | m and abundance sigma(m)-2*m = 8.at n=5A181598
• Near-perfect numbers (A181595) of the form 2^(t-1)*(2^t-2^k-1), where 2^t-2^k-1 is prime, k>=1, t>k.at n=18A181701
• Numbers of the form 2^(t-1)*(2^t-9), where 2^t-9 is prime.at n=2A181705
• Fibonacci sequence beginning 13, 11.at n=20A206607
• Numbers k such that sigma(k) == 0 (mod k+4).at n=11A274553
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 491", based on the 5-celled von Neumann neighborhood.at n=16A288653