50085
domain: N
Appears in sequences
- Triangle read by rows giving the coefficients of general sum formulas of n-th Lucas numbers (A000204). The k-th row (k>=1) contains T(i,k) for i=1 to 2*k-1, where T(i,k) satisfies L(n) = Sum_{k=1..n} Sum_{i=1..2*k-1} T(i,k) * C(n-k,i-1) * n^(n-k) / (n-1)!.at n=23A101033
- Number of partitions of n with more odd parts than even parts.at n=43A108950
- Number of partitions of n into parts that are neither all squarefree, nor all not squarefree.at n=42A117395
- Numbers k such that k and k^2 use only the digits 0, 2, 5, 7 and 8.at n=23A136916
- Numbers n such that n^2 is divisible by the sum of the distinct prime divisors of n^2 + 1.at n=28A196219
- Number of n X 4 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 1 vertically.at n=13A207064
- Triangular array read by rows: T(n, k) = S(n, [n/2]-k) and S(n,k) = C(n, 2*k)*(2*k-1)!!*((2*k-1)!! + 1)/2, n>=0, 0<=k<=[n/2].at n=25A246257
- Expansion of f(-x^8)^2 / f(-x) in powers of x where f() is a Ramanujan theta function.at n=46A260164
- Number of length-4 0..n arrays with no repeated value greater than or equal to the previous repeated value.at n=13A269410
- a(n) = Sum_{1 <= j <= n/2, gcd(j,n)=1} j^4.at n=24A295576
- a(n) = A361540(n, n-2) for n >= 2, a diagonal of triangle A361540.at n=4A361539
- Expansion of e.g.f. A(x,y) satisfying A(x,y) = Sum_{n>=0} (A(x,y)^n + y)^n * x^n/n!, as a triangle read by rows.at n=25A361540