login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109541 a(n) = a(n-2)+a(n-3)+a(n-4)+a(n-5)+2*a(n-6)+a(n-7). 0

%I

%S 1,1,1,1,1,1,1,7,7,13,19,31,49,85,133,217,349,565,913,1483,2395,3877,

%T 6271,10147,16417,26569,42985,69553,112537,182089,294625,476719,

%U 771343,1248061,2019403,3267463,5286865,8554333,13841197,22395529,36236725

%N a(n) = a(n-2)+a(n-3)+a(n-4)+a(n-5)+2*a(n-6)+a(n-7).

%H <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (0, 1, 1, 1, 1, 2, 1).

%t F[1] = 1; F[2] = 1; F[3] = 1; F[4] = 1; F[5] = 1; F[6] = 1; F[7] = 1; F[n__] := F[n] = F[n - 2] + F[n - 3] + F[n - 4] + F[n - 5] + 2*F[n - 6] + F[n - 7] aa = Table[F[n], {n, 1, 50}]

%t LinearRecurrence[{0,1,1,1,1,2,1},{1,1,1,1,1,1,1},50] (* _Harvey P. Dale_, Dec 22 2014 *)

%K nonn

%O 0,8

%A _Roger L. Bagula_, Jun 20 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 31 01:17 EST 2023. Contains 359947 sequences. (Running on oeis4.)