Search: id:A073817
Results 1-1 of 1 results found.

%I A073817
%S A073817 4,1,3,7,15,26,51,99,191,367,708,1365,2631,5071,9775,18842,36319,70007,
%T A073817 134943,260111,501380,966441,1862875,3590807,6921503,13341626,25716811,
%U A073817 49570747,95550687,184179871,355018116,684319421,1319068095,2542585503
%N A073817 Tetranacci numbers with different initial conditions a(n)=a(n-1)+a(n-2)+a(n-3)+a(n-4), 
               a(0)=4, a(1)=1, a(2)=3, a(4)=7.
%C A073817 These tetranacci numbers follow the same pattern as Lucas and generalized 
               tribonacci(A001644) numbers: Binet's formula is a(n)=r1^n+r^2^n+r3^n+r4^n, 
               with r1, r2, r3, r4 roots of the characteristic polynomial.
%D A073817 Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas 
               n-step Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article 
               05.4.4.
%H A073817 <a href="Sindx_Rea.html#recLCC">Index entries for sequences related to 
               linear recurrences with constant coefficients</a>
%H A073817 E. Weisstein, <a href="http://mathworld.wolfram.com/Fibonaccin-StepNumber.html">
               Fibonacci n-Step</a>
%F A073817 G.f.: (4-3x-2x^2-x^3)/(1-x-x^2-x^3-x^4)
%t A073817 CoefficientList[Series[(4-3x-2x^2-x^3)/(1-x-x^2-x^3-x^4), {x, 0, 40}], 
               x]
%Y A073817 Cf. A000078, A001630, A001644, A000032. Two other versions: A001648, 
               A074081.
%Y A073817 Sequence in context: A074813 A151861 A109531 this_sequence A074081 A132703 
               A154182
%Y A073817 Adjacent sequences: A073814 A073815 A073816 this_sequence A073818 A073819 
               A073820
%K A073817 easy,nonn
%O A073817 0,1
%A A073817 Mario Catalani (mario.catalani(AT)unito.it), Aug 12 2002

Search completed in 0.002 seconds