26902

Appears in sequences

• a(1) = 1 and for n > 1 let a(n) = a(n-1) + m, where m is the arithmetic mean of the largest subset of all predecessors such that m is an integer and m is maximal.at n=39A063676
• Number of binary strings of length n with no substrings equal to 0010 0110 or 1100.at n=16A164498
• Integers which can be written in exactly three ways as sum of two distinct nonzero pentagonal numbers.at n=34A333013