49002
domain: N
Appears in sequences
- a(0) = 1, a(n) = 40*n^2 + 2 for n>0.at n=35A010022
- a(n) = sqrt(2*(P(n)^4 + 16*P(n+1)^4 + P(n+2)^4)), where P() = Pell numbers A000129.at n=6A133417
- Triangle read by rows: T(n,k) number of ways of partitioning the (n+3)-element multiset {1,1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 3.at n=83A291118
- Expansion of Sum_{n>=1} x^(n*(n+1)/2)*((1+x)/(1-x))^n.at n=26A369425