62454
domain: N
Appears in sequences
- G.f. satisfies: A(x) = Sum_{n>=0} 3^n*A(x)^n * x^(n^2) / Product_{k=1..n} (1 - 3*x^k)*(1 - x^k*A(x)).at n=6A206638
- Number of binary words of length n with exactly 10 (possibly overlapping) occurrences of the subword given by the binary expansion of n.at n=42A236239
- a(n) = (n^4 - n^3 + 4*n^2 + 2)/2.at n=19A239592