20843

Appears in sequences

• Unicode codes for the Han digits.at n=8A061745
• a(n+1) = 2a(n)-a([n/2]) starting with a(0)=0 and a(1)=1.at n=17A062178
• Number of partitions of n with difference -7 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=42A242685
• Floor(r*a(n-1)) + floor(r*a(n-2)), where r = 5/3, a(0) = 1, a(1) = 1.at n=13A275864
• Relative of Hofstadter Q-sequence: a(n) = max(0, n+20830) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0.at n=16A283887
• Relative of Hofstadter Q-sequence: a(n) = max(0, n+20830) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0.at n=18A283887
• Relative of Hofstadter Q-sequence: a(n) = max(0, n+20830) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0.at n=33A283887
• Expansion of 1/(1 - x*Product_{k>=1} 1/(1 - x^k)^k).at n=11A299166