Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Mar 14 2024 15:21:07
%S 1,4,15,51,183,655,2381,8653,31539,114927,419001,1527457,5568791,
%T 20302171,74016909,269846637,983794491,3586668535,13076103713,
%U 47672218297,173801058495,633635426355,2310077203221,8421966964069
%N Expansion of g.f. (1-x-2*x^2-x^3+x^4)/((x-1)^3*(6*x^2+2*x-1)).
%C The definition of this sequence given in the program code is, without a doubt, involved. This is in contrast to its "relatively simple" generating function (which came as a small surprise). At least in principle, it is certainly possible that a simpler definition involving floretions can be found.
%C Floretion Algebra Multiplication Program, FAMP Code: Fortype: Type 1A Roktype: (left factor): Y[sqa.Findk()] = Y[sqa.Findk()] - Math.signum(Y[sqa.Findk()])*p (internal program code) Roktype (right factor): Do nothing. Fiztype: ChuRed (a(n)) = jessigforcycfizholrok(infty)-1jessigforcycfizholrokseq[(.5'j + .5j' + e)(- .5'i + .5'j - .5i' + .5j' - 'kk' - .5'ik' - .5'jk' - .5'ki' - .5'kj')]
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-3,-11,16,-6).
%K nonn,easy
%O 0,2
%A _Creighton Dement_, May 20 2005