107338

Appears in sequences

• Row sums of A117692.at n=10A117693
• Consider 1-D random walk with jumps up to the third neighbor, i.e., set of possible jumps is {-3,-2,-1,+1,+2,+3}. Sequence gives number of paths of length n ending at origin.at n=8A117813
• Number of values generated by the algorithm given as first comment.at n=19A181533
• Unitary abundant numbers k such that k+2 is also unitary abundant.at n=4A292704