9401540

Appears in sequences

• Consider the sequence of 4-tuples {0,a,b,c} (c>=a+b; a,b,c>0) which have the smallest integer 'c' required to reach {k,k,k,k} in n steps under map {r,s,t,u}->{|r-s|,|s-t|,|t-u|,|u-r|}. This sequence gives the third term 'b' of these quadruples.at n=42A034804
• Number of ways to toss a coin n times and not get a run of four.at n=26A135491
• First differences of A000213, also twice A000073.at n=28A354784