66012

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=21A000073
• 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=29A045794
• Minimum value t such that all quadruples of Diffy_length >= n have a maximal value >= t.at n=31A065678
• a(n) = T(2n+1), where T(n) are the tribonacci numbers A000073.at n=10A073717
• Sigmabonacci numbers: a(n)=a(n-1)+Sigma(a(n-2)). Sigma(n)=Sum of divisors of n.at n=17A074371
• 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=20A075536
• Trisection of tribonacci numbers.at n=7A099464
• a(n) = tribonacci(Fibonacci(n)).at n=8A111425
• 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=43A114952
• Tribonacci numbers A000073 which can be the hypotenuse of a Pythagorean triple.at n=6A130611
• a(n) = number of 9-digit primes with digit sum n, where n runs through the non-multiples of 3 in the range [2..80].at n=42A178884
• Number of nX4 binary arrays with every element equal to either the sum mod 2 of its vertical neighbors or the sum mod 2 of its horizontal neighbors.at n=6A183469
• Number of nX7 binary arrays with every element equal to either the sum mod 2 of its vertical neighbors or the sum mod 2 of its horizontal neighbors.at n=3A183472
• T(n,k)=Number of nXk binary arrays with every element equal to either the sum mod 2 of its vertical neighbors or the sum mod 2 of its horizontal neighbors.at n=48A183474
• T(n,k)=Number of nXk binary arrays with every element equal to either the sum mod 2 of its vertical neighbors or the sum mod 2 of its horizontal neighbors.at n=51A183474
• Tribonacci sequences A000073 and A001590 interleaved.at n=38A213816
• Number of partitions p of n such that (sum of parts with multiplicity 1) < (sum of all other parts).at n=47A240448
• Number of partitions p of n such that (sum of parts with multiplicity 1) <= (sum of all other parts).at n=47A240449
• Satisfies the tribonacci recurrence: a(n) = a(n-1) + a(n-2) + a(n-3).at n=19A282718
• Numbers of the form t_n or t_n + t_{n+1} where {t_n} are the tribonacci numbers A000073.at n=36A308189