OFFSET
0,3
COMMENTS
A000073 is the tribonacci numbers. A113300 is the sum of even-indexed terms of tribonacci numbers. A099463 is the bisection of the tribonacci numbers. A113300(n) + A113301(n) = cumulative sum of tribonacci numbers = A008937(n). Primes in A113300 include a(2) = 5, a(5) = 211, a(9) = 27701, .... A113300 is semiprime for n = 4, 10, 14, ...
LINKS
Harvey P. Dale, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,-2,0,-1).
FORMULA
a(n) = Sum_{j=0..n} A000073(2*j+1).
a(n) = 4*a(n-1) - 2*a(n-2) - a(n-4), a(0)=0, a(1)=1, a(2)=5, a(3)=18. - Harvey P. Dale, Apr 12 2013
G.f.: x*(1+x) / ((1-x)*(1-3*x-x^2-x^3)). - Colin Barker, May 06 2013
EXAMPLE
MATHEMATICA
Accumulate[Take[LinearRecurrence[{1, 1, 1}, {0, 1, 1}, 40], {1, -1, 2}]] (* or *) LinearRecurrence[{4, -2, 0, -1}, {0, 1, 5, 18}, 30] (* Harvey P. Dale, Apr 12 2013 *)
PROG
(Magma) I:=[0, 1, 5, 18]; [n le 4 select I[n] else 4*Self(n-1) - 2*Self(n-2) -Self(n-4): n in [1..41]]; // G. C. Greubel, Nov 20 2021
(Sage)
@CachedFunction
def T(n): # A000073
if (n<2): return 0
elif (n==2): return 1
else: return T(n-1) +T(n-2) +T(n-3)
def A113301(n): return sum(T(2*j+1) for j in (0..n))
[A113301(n) for n in (0..40)] # G. C. Greubel, Nov 20 2021
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, Oct 24 2005
EXTENSIONS
More terms from Colin Barker, May 06 2013
STATUS
approved