178630

Appears in sequences

• Form a triangle with n numbers in top row; all other numbers are the sum of their parents. E.g.: 4 1 2 7; 5 3 9; 8 12; 20. The numbers must be positive and distinct and the final number is to be minimized. Sequence gives final number.at n=15A028307
• Number of (n+1)X(4+1) 0..1 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..4+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=4A232857
• Number of (n+1)X(5+1) 0..1 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..5+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=3A232858
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=31A232860
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=32A232860