66190
domain: N
Appears in sequences
- (Presumed) solution to Waring's problem: g(n) = 2^n + floor((3/2)^n) - 2.at n=15A002804
- a(n) = T(2n-1,n-1), T given by A026648.at n=8A026652
- a(n) = T(n,[ n/2 ]), T given by A026648.at n=17A026654
- Partial sums of A006156.at n=27A177736
- Number of partitions of n where the difference between consecutive parts is at most 6.at n=46A238866