8546887871
domain: N
Appears in sequences
- Binomial transform of poly-Bernoulli numbers A027649.at n=16A085350
- Row sums of triangular array T: T(j,1) = 1 for ((j-1) mod 6) < 3, else 0; T(j,k) = T(j-1,k-1) + T(j-1,k) for 2 <= k <= j.at n=33A131024
- a(n) = 2^n - A108411(n).at n=33A167936
- a(n) = 3^n + (4^n - 3^n) * (d(n) - 3), where d(n) = A000005(n).at n=15A231919