132051

Appears in sequences

• Number of 0..4 arrays x(0..n-1) of n elements with each no smaller than the sum of its two previous neighbors modulo 5.at n=9A207096
• Numbers k such that d(k) < d(k+1) < d(k+2) < d(k+3) < d(k+4), where d(n) is the number of divisors of n.at n=23A364717