OFFSET
0,5
COMMENTS
A floretion-generated sequence: 'i + 0.5('ij' + 'ik' + 'ji' + 'jk' + 'ki' + 'kj')
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Matthias Beck, Neville Robbins, Variations on a Generatingfunctional Theme: Enumerating Compositions with Parts Avoiding an Arithmetic Sequence, arXiv:1403.0665 [math.NT], 2014.
Creighton Dement, Online Floretion Multiplier [broken link]
Milan Janjic, Binomial Coefficients and Enumeration of Restricted Words, Journal of Integer Sequences, 2016, Vol 19, #16.7.3.
YĆ¼ksel Soykan, Summing Formulas For Generalized Tribonacci Numbers, arXiv:1910.03490 [math.GM], 2019.
Index entries for linear recurrences with constant coefficients, signature (0,1,2).
FORMULA
a(n) = abs(A078028(n-1)). - R. J. Mathar, Jul 05 2012
a(n) = a(n-2) + 2*a(n-3), a(0)=0, a(1) = a(2) =1. - G. C. Greubel, Apr 30 2017
MATHEMATICA
CoefficientList[Series[x (1+x)/(1-x^2-2x^3), {x, 0, 50}], x] (* or *) LinearRecurrence[ {0, 1, 2}, {0, 1, 1}, 50] (* Harvey P. Dale, Jul 16 2013 *)
PROG
(PARI) a(n)=([0, 1, 0; 0, 0, 1; 2, 1, 0]^n*[0; 1; 1])[1, 1] \\ Charles R Greathouse IV, Oct 03 2016
(Magma) I:=[0, 1, 1]; [n le 3 select I[n] else Self(n-2) + 2*Self(n-3): n in [1..30]]; // G. C. Greubel, Jun 27 2018
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Creighton Dement, Apr 08 2009
EXTENSIONS
Deleted certain dangerous or potentially dangerous links. - N. J. A. Sloane, Jan 30 2021
STATUS
approved