31440

Appears in sequences

• a(n) = T(7,n), array T given by A048505.at n=8A048512
• Numbers n such that 2*10^n + 6*R_n + 3 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=21A102957
• Numbers n such that 9*10^n-7 is prime.at n=24A103092
• Partial sums of A002522, starting at n=1.at n=44A145066
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 0, -1), (0, 1, 1), (1, 0, 1)}.at n=8A150484
• Recursive triangular symmetrical sequence: A(n,k) := (n - k + 1)A(n - 1, k - 1) + (k)* A(n - 1, k) - (n + 1)*A(n - 2, k - 1).at n=39A153479
• Recursive triangular symmetrical sequence: A(n,k) := (n - k + 1)A(n - 1, k - 1) + (k)* A(n - 1, k) - (n + 1)*A(n - 2, k - 1).at n=41A153479
• Expansion of d/dx arctan(x*A001003(x)).at n=7A187071
• Molecular topological indices of the pan graphs.at n=38A192836
• Number of 5 X n 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.at n=8A208640
• Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7.at n=10A252299
• Numbers n such that there exists an x!=n that makes {n,n,x} an amicable multiset.at n=8A259302
• Abundant numbers n such that sigma(sigma(n) - 2*n) = sigma(n).at n=10A292365
• a(n) is the end square spiral number for a knight starting on square n moving on a board with squares numbered with the square of their distance from the 0-square origin and where the knight moves to the smallest numbered unvisited square; the smallest spiral number ordering is used if the distances are equal.at n=3A326931
• a(n) is the end square spiral number for a knight starting on square n moving on a board with squares numbered with the square of their distance from the 0-square origin and where the knight moves to the smallest numbered unvisited square; the smallest spiral number ordering is used if the distances are equal.at n=5A326931