35890

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=20A000073
• 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=32A034803
• a(n) = floor(n^sqrt(n)).at n=14A066641
• Sequences A001644 and A000073 interleaved.at n=19A075676
• Bisection of tribonacci numbers.at n=10A099463
• 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=40A114952
• Tribonacci numbers A000073 which can be the hypotenuse of a Pythagorean triple.at n=5A130611
• 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=7A192806
• Triangle read by rows: T(n,k) is the k-th generalized Eulerian number of order n and degree 3, n >= 1.at n=48A211233
• Triangle read by rows: T(n,k) is the k-th generalized Eulerian number of order n and degree 3, n >= 1.at n=50A211233
• Tribonacci sequences A000073 and A001590 interleaved.at n=36A213816
• Tribonacci numbers which can be written in the form a^2 + b^2.at n=10A216670
• Satisfies the tribonacci recurrence: a(n) = a(n-1) + a(n-2) + a(n-3).at n=18A282718
• Number of 6-cycles in the n X n king graph.at n=18A288920
• Numbers of the form t_n or t_n + t_{n+1} where {t_n} are the tribonacci numbers A000073.at n=34A308189
• Number of compositions (ordered partitions) of n into divisors of n that are at most sqrt(n).at n=18A327766
• a(0) = ... = a(3) = 1; a(n) = a(n-4) + Sum_{k=0..n-5} a(k) * a(n-k-5).at n=29A343305
• Number of compositions (ordered partitions) of n into divisors of n that are smaller than sqrt(n).at n=18A357312
• a(n) is the smallest tribonacci number (A000073) with exactly n distinct prime factors.at n=4A359848
• Number of compositions (ordered partitions) of n into squarefree parts not greater than sqrt(n).at n=18A369220