223317

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=23A000073
• 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=32A045794
• Minimum value t such that all quadruples of Diffy_length >= n have a maximal value >= t.at n=34A065678
• a(n) = T(2n+1), where T(n) are the tribonacci numbers A000073.at n=11A073717
• 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=22A075536
• Expansion of -x^2*(x^9-x^8+2*x^7-x^6+x^5-2*x^4+x^2+1) / ((x^6-x^4+x^2+1) * (x^6+x^4+x^2-1)).at n=47A114952
• a(n) = 7*a(n-1) - 5*a(n-2) + a(n-3), with initial values a(0) = a(1) = 1, a(2)=4.at n=8A192806
• Tribonacci sequences A000073 and A001590 interleaved.at n=42A213816
• Satisfies the tribonacci recurrence: a(n) = a(n-1) + a(n-2) + a(n-3).at n=21A282718
• Numbers of the form t_n or t_n + t_{n+1} where {t_n} are the tribonacci numbers A000073.at n=40A308189
• Inverse Moebius transform of tribonacci numbers (A000073).at n=22A357238
• Number of compositions (ordered partitions) of n into squarefree parts not greater than sqrt(n).at n=21A369220