4700770

Appears in sequences

• Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3 with a(0) = a(1) = 0 and a(2) = 1.at n=28A000073
• 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 second term 'a' of these quadruples.at n=44A034803
• a(n) = T(3n+1), where T(n) are tribonacci numbers A000073.at n=9A074581
• Sequences A001644 and A000073 interleaved.at n=27A075676
• Bisection of tribonacci numbers.at n=14A099463
• a(n) is the sum of the (1,2)- and (1,3)-entries of the matrix P^n + T^n, where the 3 X 3 matrices P and T are defined by P = [0,1,0; 0,0,1; 1,0,0] and T = [0,1,0; 0,0,1; 1,1,1].at n=27A109523
• Tribonacci numbers A000073 which can be the hypotenuse of a Pythagorean triple.at n=10A130611
• Tribonacci numbers which can be written in the form a^2 + b^2.at n=13A216670
• Satisfies the tribonacci recurrence: a(n) = a(n-1) + a(n-2) + a(n-3).at n=26A282718
• Numbers of the form t_n or t_n + t_{n+1} where {t_n} are the tribonacci numbers A000073.at n=50A308189