391232
domain: N
Appears in sequences
- Largest coefficient in expansion of P(0)=x, P(n+1)=P(n)*[1+P(n)].at n=5A092123
- Triangle, read by rows, where row n lists the coefficients of x^k, k=1..2^n, in the n-th iteration of (x + x^2) for n>=0.at n=49A122888
- Triangle (read by rows) of coefficients of the polynomials (in ascending order) of the denominators of the generalized sequence s(n) of the sum resp. product of generalized fractions f(n) defined recursively by f(1) = m/1; f(n+1) is chosen so that the sum and the product of the first n terms of the sequence are equal.at n=44A225201
- Number of (n+1)X(3+1) 0..5 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 10.at n=2A234086
- T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 10 (10 maximizes T(1,1)).at n=12A234091