27906

Appears in sequences

• Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-7).at n=24A023437
• a(n) = n^n - n*(n-1)^(n-1).at n=6A060226
• Barely abundant numbers: abundant n such that sigma(n)/n < sigma(m)/m for all abundant numbers m<n, sigma(n) being the sum of the divisors of n.at n=37A071927
• Row sums of A163233 and A163235.at n=34A163242
• Triangle read by rows: T(n,k) (1 <= k <= n) defined by T(n,n) = (n-1)^(n-1), T(n,k) = T(n,k+1) - (n-1)*T(n-1,k) for k = n-1 .. 1.at n=26A241580
• Number of 4 X n 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=16A281472