755476

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=25A000073
• Consider all quadruples {a,b,c,d} which reach {k,k,k,k} in n steps under map {a,b,c,d}->{|a-b|,|b-c|,|c-d|,|d-a|}; look at max{a,b,c,d}; sequence gives minimal value of this.at n=35A045794
• Minimum value t such that all quadruples of Diffy_length >= n have a maximal value >= t.at n=37A065678
• a(n) = T(2n+1), where T(n) are the tribonacci numbers A000073.at n=12A073717
• a(n) = T(3n+1), where T(n) are tribonacci numbers A000073.at n=8A074581
• a(n) = ((1+(-1)^n)*T(n+1) + (1-(-1)^n)*S(n))/2, where T(n) = tribonacci numbers A000073, S(n) = generalized tribonacci numbers A001644.at n=24A075536
• 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=24A109523
• Tribonacci numbers A000073 which can be the hypotenuse of a Pythagorean triple.at n=8A130611
• Tribonacci sequences A000073 and A001590 interleaved.at n=46A213816
• Tribonacci numbers which can be written in the form a^2 + b^2.at n=11A216670
• Satisfies the tribonacci recurrence: a(n) = a(n-1) + a(n-2) + a(n-3).at n=23A282718
• Numbers of the form t_n or t_n + t_{n+1} where {t_n} are the tribonacci numbers A000073.at n=44A308189
• Number of compositions (ordered partitions) of n into squarefree parts not greater than sqrt(n).at n=23A369220