30592

Appears in sequences

• Numbers k such that sigma(k+2) = sigma(k).at n=33A007373
• Expansion of tan(x)*sinh(sin(x))/2.at n=5A024251
• Number of partitions of n that do not contain 3 as a part.at n=44A027337
• Numbers m such that m divides sigma(m) - d(m).at n=8A056075
• Duplicate of A056075.at n=8A070019
• a(n) = 4*a(n-1) + 4*a(n-2), a(0)=1, a(1)=2.at n=7A084128
• Numbers n whose abundance is 16.at n=7A141547
• Abundant numbers n such that n/(sigma(n)-2n) is an integer.at n=31A153501
• 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=29A181595
• Numbers m with divisor 16 | m and abundance sigma(m)-2*m = 16.at n=1A181599
• 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=14A181701
• Numbers of the form 2^(t-1)*(2^t-17), where 2^t-17 is prime.at n=1A181706
• Molecular topological indices of the web graphs.at n=15A192850
• Number of nondecreasing -n..n vectors of length 3 whose dot product with some nonincreasing -n..n vector equals 3.at n=28A226400
• Numbers n such that if x=sigma(n)-tau(n)-n then n=sigma(x)-tau(x)-x.at n=21A238227
• Decimal representation of the n-th iteration of the "Rule 230" elementary cellular automaton starting with a single ON (black) cell.at n=7A267855
• Numbers k such that sigma(k) == 0 (mod k+8).at n=11A274561
• Admirable numbers such that the subtracted divisor is a Fibonacci number.at n=21A282754
• 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 299", based on the 5-celled von Neumann neighborhood.at n=14A287538
• Growth series for group with presentation < S, T : S^2 = T^3 = (S*T)^7 = 1 >.at n=40A298805