119811

Appears in sequences

• Numbers n such that n^2 + (n+1)^2 + (n+2)^2 is palindromic.at n=11A027573
• Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n having k UU's starting at level 0 (i.e., doublerises at level 1; n >= 0, 0 <= k <= floor(n/2)).at n=31A129168
• Number of 7 X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 7 X n array.at n=20A220037
• Consider all ways of writing the composite Fibonacci number A090206(n+3) as product of two divisors d1*d2 = d3*d4 = ... The sequence a(n) gives the minimum sums of {d1+d2, d3+d4,...}.at n=32A287273