28456

Appears in sequences

• Numbers n > 1 such that n^5 - 2 has no prime factor > n.at n=4A083955
• Related to Gray codes: see Comments lines.at n=6A091969
• Triangle read by rows: with a(n,m,k) defined in A091969: T(n,m)=a(n, 2^(n - 1), 2^(m - 1)).at n=26A143266
• Triangle read by rows: with a(n,m,k) defined in A091969: T(n,m)=a(n, 2^(n - 1), 2^(m - 1)).at n=27A143266
• Multiply a(n-1) by 2 and drop all 0's.at n=40A242350
• a(n) = (n/2) * (n^3 - 2*n^2 - 2*n + 5).at n=16A242983
• Number of (n+1)X(6+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=0A250630
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=15A250632
• Number of (1+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=5A250633
• Least integer k such that A001358(k) + A001358(k+1) is the product of exactly n prime factors (counting multiplicity).at n=15A288517
• Column 3 of A142249.at n=7A293561
• Expansion of (1-x-2*x^2) / (1-2*x-4*x^2+2*x^3).at n=10A384677