132055
domain: N
Appears in sequences
- (Presumed) solution to Waring's problem: g(n) = 2^n + floor((3/2)^n) - 2.at n=16A002804
- Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*11^j.at n=16A038277
- Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*7^j.at n=19A038321
- Triangle read by rows: T(n,k) = number of partitions of [1..k] into n nonempty clumps of sizes 1, 2, 3, 4 or 5 (n >= 0, 0 <= k <= 5n).at n=45A151338
- The triangle in A151338 read by rows downwards.at n=70A151509