72588

Appears in sequences

• a(1) = a(2) = a(3) = 1; for n>2, a(n+1) = a(n) + a(n-1) + a(n-2) iff a(n) is prime, otherwise a(n+1) = a(n) + 1.at n=39A113058
• Summed lengths of all nonintersecting rook paths on a 3 x n board.at n=7A181394
• Summed lengths of nonintersecting rook paths on an n X k board (square array by antidiagonals).at n=47A181399
• Summed lengths of nonintersecting rook paths on an n X k board (square array by antidiagonals).at n=52A181399
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing odd cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be odd if it has an odd number of entries. For example, the permutation (152)(347)(6)(8) has 3 increasing odd cycles.at n=47A186761
• Numbers N such that N + the sum of the cubes of its digits is again a third power.at n=35A362953