76011

Appears in sequences

• a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 9.at n=20A022323
• a(n) = a(n-1)+a(n-2)-Floor(a(n-3)/2)-Floor(a(n-8)/2); initial terms are 0, 1, 1, 2, 3, 5, 7, 11.at n=32A173199
• Number of length n+3 0..2 arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms.at n=13A249701
• a(n) is the smallest integer k such that k is the sum of exactly n distinct permutations of k, all having the same number of digits as k.at n=6A384708