49084
domain: N
Appears in sequences
- a(n) = [ 1/(2*t(n+1) - t(n) - t(n+2)) ], where t(n) = tan(Pi/2 - 1/n) satisfies n-1 < t(n) < n for all n >= 1.at n=30A024817
- 'Reverse and Add!' trajectory of 10583.at n=1A066054
- Number of partitions p of n containing floor((min(p) + max(p))/2) as a part.at n=47A238482
- Number of partitions p of n such that max(p) == 1 mod 3.at n=48A373014