4190208

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 (2,8)-perfect numbers.at n=14A019285
• Number of primitive (aperiodic) palindromes using a maximum of four different symbols.at n=21A056460
• Nonsquarefree numbers m such that rad(m+1)=rad(m)+1, where rad(m)=A007947(m) is the squarefree kernel of m.at n=7A081084
• Numbers m such that A007947(m) = A007947(k) and A007947(m+1) = A007947(k+1), for some k < m.at n=10A087914
• Number of bitstrings of length n (with at least two runs) where the last two runs have different lengths.at n=21A208901
• Total area of all squares and rectangles after 2^n stages in the toothpick structure of A139250, assuming the toothpicks have length 2.at n=11A211012
• Number of non-palindromic n-tuples of 4 distinct elements.at n=10A242026
• Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 261", based on the 5-celled von Neumann neighborhood.at n=10A271061
• Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 657", based on the 5-celled von Neumann neighborhood.at n=10A273335
• Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 721", based on the 5-celled von Neumann neighborhood.at n=10A273446
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 65", based on the 5-celled von Neumann neighborhood.at n=21A278755
• a(n) = 2*a(n-1) + 2*a(n-2) - 4*a(n-3), a(1) = 0, a(2) = 0, a(3) = 8.at n=20A297619
• Pairs of integers (k, m) ordered by m with 1 < k < m such that k has the same prime divisors as m, and, k+1 has the same prime divisors as m+1.at n=21A343101
• Number of subsets of {1..n} containing n such that some element can be written as a nonnegative linear combination of the others.at n=23A365046