410744

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=24A000073
• 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=38A034803
• Sequences A001644 and A000073 interleaved.at n=23A075676
• Bisection of tribonacci numbers.at n=12A099463
• Trisection of tribonacci numbers.at n=8A099464
• 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=48A114952
• Tribonacci sequences A000073 and A001590 interleaved.at n=44A213816
• Satisfies the tribonacci recurrence: a(n) = a(n-1) + a(n-2) + a(n-3).at n=22A282718
• Numbers of the form t_n or t_n + t_{n+1} where {t_n} are the tribonacci numbers A000073.at n=42A308189
• Number of compositions (ordered partitions) of n into squarefree parts not greater than sqrt(n).at n=22A369220