39306

Appears in sequences

• a(n) = (n-1)*(n-2)*(n-3) + n.at n=35A034324
• a(n) = smallest k such that k! ends in 2^n, not counting the trailing zeros.at n=21A058885
• a(n) = n^3 + 2.at n=34A084380
• Numbers k such that the three second-degree cyclotomic polynomials x^2 + 1, x^2 - x + 1 and x^2 + x + 1 are simultaneously prime when evaluated at x=k.at n=23A087277
• Number of (n+1) X 4 0..2 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=3A206272
• Number of (n+1) X 5 0..2 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=2A206273
• T(n,k) = number of (n+1) X (k+1) 0..2 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=17A206277
• T(n,k) = number of (n+1) X (k+1) 0..2 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=18A206277