login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214286 a(n) = floor(Fibonacci(n)/7). 1

%I

%S 0,0,0,0,0,0,1,1,3,4,7,12,20,33,53,87,141,228,369,597,966,1563,2530,

%T 4093,6624,10717,17341,28059,45401,73461,118862,192324,311187,503511,

%U 814698,1318209,2132907,3451116,5584024,9035140,14619165

%N a(n) = floor(Fibonacci(n)/7).

%H Vincenzo Librandi, <a href="/A214286/b214286.txt">Table of n, a(n) for n = 0..1000</a>

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

%F G.f.: x^6*(1+x^2+x^5+x^6+x^7+x^9+x^10) / ( (1-x-x^2)*(1-x^16) ). - _R. J. Mathar_, Jul 14 2012

%F a(n) = (A000045(n) - A105870(n))/7. - _R. J. Mathar_, Jul 14 2012

%t Floor[Fibonacci[Range[0, 40]]/7] (* modified by _G. C. Greubel_, May 22 2019 *)

%o (MAGMA) [Floor(Fibonacci(n)/7): n in [0..40]];

%o (PARI) vector(40, n, n--; fibonacci(n)\7 ) \\ _G. C. Greubel_, May 22 2019

%o (Sage) [floor(fibonacci(n)/7) for n in (0..40)] # _G. C. Greubel_, May 22 2019

%Y Cf. A004695-A004699.

%K nonn,easy

%O 0,9

%A _Vincenzo Librandi_, Jul 10 2012

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 16:27 EST 2020. Contains 331011 sequences. (Running on oeis4.)