32313

Appears in sequences

• Becomes prime or 4 after exactly 9 iterations of f(x) = sum of prime factors of x.at n=29A048131
• a(n) = (1/9)*((6*n - 7)*2^(n-1) - (-1)^n).at n=12A113861
• Least power of 3 having exactly n consecutive 9's in its decimal representation.at n=7A131544
• a(n) = -Floor[n/2]! + Sum[(Eulerian[n - j, j]), {j, 0, Floor[n/2]}].at n=10A174993
• Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..2 nX5 array.at n=2A219060
• T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..2 nXk array.at n=23A219063
• Hilltop maps: number of 3Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..2 3Xn array.at n=4A219064
• a(0)=0, a(1)=1, a(n) = min{4 a(k) + (4^(n-k)-1)/3, k=0..(n-1)} for n>=2.at n=27A259665
• Triangle read by rows: T(n,k) is the number of inequivalent colorings of lone-child-avoiding rooted trees with n colored leaves using exactly k colors.at n=53A339645
• Squarefree numbers k for which Q(k) - 6*k/Pi^2 sets a new record minimum, where Q(x) is the number of squarefree numbers up to x.at n=23A339865
• a(n) = floor(2^(n-1)) - binomial(n,3) + binomial(n,2) - n + 1.at n=16A347017