69096

Appears in sequences

• Number of permutations of floor(i*7/3), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique.at n=8A147937
• Number of permutations of floor(i*7/3), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=8A147946
• Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,1,0,0,0 for x=0,1,2,3,4.at n=10A197470
• Number of (n+1)X(2+1) 0..2 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..2+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=3A232850
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=11A232852
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=13A232852
• Cyclops numbers with circular digits {0,6,8,9}.at n=34A274765
• Positive integers k at which k/log_2(k) is at a record closeness to an integer, without actually being an integer.at n=11A307099