1389537

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=26A000073
• 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=41A034803
• Number of ways writing n^n as a product of decimal digits of some other number which has no digits equal to 1.at n=7A068185
• Sequences A001644 and A000073 interleaved.at n=25A075676
• Bisection of tribonacci numbers.at n=13A099463
• Tribonacci numbers A000073 which can be the hypotenuse of a Pythagorean triple.at n=9A130611
• 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=9A192806
• Tribonacci numbers which can be written in the form a^2 + b^2.at n=12A216670
• Satisfies the tribonacci recurrence: a(n) = a(n-1) + a(n-2) + a(n-3).at n=24A282718
• Numbers of the form t_n or t_n + t_{n+1} where {t_n} are the tribonacci numbers A000073.at n=46A308189
• Number of compositions (ordered partitions) of n into squarefree parts not greater than sqrt(n).at n=24A369220