cp's OEIS Frontend

A107239 Sum of squares of tribonacci numbers (A000073).

%I A107239 #52 Feb 16 2025 08:32:57
%S A107239 0,0,1,2,6,22,71,240,816,2752,9313,31514,106590,360606,1219935,
%T A107239 4126960,13961456,47231280,159782161,540539330,1828631430,6186215574,
%U A107239 20927817799,70798300288,239508933824,810252920400,2741065994769,9272959837818,31370198430718
%N A107239 Sum of squares of tribonacci numbers (A000073).
%D A107239 R. Schumacher, Explicit formulas for sums involving the squares of the first n Tribonacci numbers, Fib. Q., 58:3 (2020), 194-202.
%H A107239 G. C. Greubel, <a href="/A107239/b107239.txt">Table of n, a(n) for n = 0..1000</a>
%H A107239 M. Feinberg, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/1-3/feinberg.pdf">Fibonacci-Tribonacci</a>, Fib. Quart. 1(3) (1963), 71-74.
%H A107239 Z. Jakubczyk, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Problems/August2013advanced.pdf">Advanced Problems and Solutions</a>, Fib. Quart. 51 (3) (2013) 185, H-715.
%H A107239 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TribonacciNumber.html">Tribonacci Number</a>
%H A107239 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (3,1,3,-7,1,-1,1).
%F A107239 a(n) = T(0)^2 + T(1)^2 + ... + T(n)^2 where T(n) = A000073(n).
%F A107239 From _R. J. Mathar_, Aug 19 2008: (Start)
%F A107239 a(n) = Sum_{i=0..n} A085697(i).
%F A107239 G.f.: x^2*(1-x-x^2-x^3)/((1+x+x^2-x^3)*(1-3*x-x^2-x^3)*(1-x)). (End)
%F A107239 a(n) = 1/4 - (1/11)*Sum_{_R = RootOf(_Z^3-_Z^2-_Z-1)} ((3 + 7*_R + 5*_R^2)/(3*_R^2 - 2*_R - 1)*_R^(-n) - (1/44)*Sum_{_R = RootOf(_Z^3+_Z^2+3*_Z-1)} ((-1 - 2*_R - 9*_R^2)/(3*_R^2 + 2*_R + 3)*_R^(-n). - _Robert Israel_, Mar 26 2010
%F A107239 a(n+1) = A000073(n)*A000073(n+1) + ( (A000073(n+1) - A000073(n-1))^2 - 1 )/4 for n>0 [Jakubczyk]. - _R. J. Mathar_, Dec 19 2013
%e A107239 a(7) = 71 = 0^2 + 0^2 + 1^2 + 1^2 + 2^2 + 4^2 + 7^2
%p A107239 b:= proc(n) option remember; `if`(n<3, [n*(n-1)/2$2],
%p A107239      (t-> [t, t^2+b(n-1)[2]])(add(b(n-j)[1], j=1..3)))
%p A107239     end:
%p A107239 a:= n-> b(n)[2]:
%p A107239 seq(a(n), n=0..30);  # _Alois P. Heinz_, Nov 22 2021
%t A107239 Accumulate[LinearRecurrence[{1,1,1},{0,0,1},30]^2] (* _Harvey P. Dale_, Sep 11 2011 *)
%t A107239 LinearRecurrence[{3,1,3,-7,1,-1,1}, {0,0,1,2,6,22,71}, 30] (* _Ray Chandler_, Aug 02 2015 *)
%o A107239 (Magma) R<x>:=PowerSeriesRing(Integers(), 40); [0,0] cat Coefficients(R!( x^2*(1-x-x^2-x^3)/((1+x+x^2-x^3)*(1-3*x-x^2-x^3)*(1-x)) )); // _G. C. Greubel_, Nov 20 2021
%o A107239 (Sage)
%o A107239 @CachedFunction
%o A107239 def T(n): # A000073
%o A107239     if (n<2): return 0
%o A107239     elif (n==2): return 1
%o A107239     else: return T(n-1) +T(n-2) +T(n-3)
%o A107239 def A107231(n): return sum(T(j)^2 for j in (0..n))
%o A107239 [A107239(n) for n in (0..40)] # _G. C. Greubel_, Nov 20 2021
%Y A107239 Cf. A000073, A000213, A085697.
%Y A107239 Cf. A107240, A107241, A107242, A107243, A107244, A107245, A107246, A107247.
%K A107239 easy,nonn
%O A107239 0,4
%A A107239 _Jonathan Vos Post_, May 17 2005