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!)
A306756 a(n) = a(n-7) + a(n-8) with a(0)=8, a(1)=...=a(6)=0, a(7)=7. 2
8, 0, 0, 0, 0, 0, 0, 7, 8, 0, 0, 0, 0, 0, 7, 15, 8, 0, 0, 0, 0, 7, 22, 23, 8, 0, 0, 0, 7, 29, 45, 31, 8, 0, 0, 7, 36, 74, 76, 39, 8, 0, 7, 43, 110, 150, 115, 47, 8, 7, 50, 153, 260, 265, 162, 55, 15, 57, 203, 413, 525, 427, 217, 70, 72, 260, 616, 938, 952, 644, 287, 142 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Conjecture: If p is prime, p divides a(p).
LINKS
FORMULA
G.f.: (8 - x^7)/(1 - x^7 - x^8).
a(0) = 8 and a(n) = n*Sum_{k=1..floor(n/7)} binomial(k,n-7*k)/k for n > 0.
MATHEMATICA
LinearRecurrence[{0, 0, 0, 0, 0, 0, 1, 1}, {8, 0, 0, 0, 0, 0, 0, 7}, 100] (* Amiram Eldar, Jun 21 2021 *)
PROG
(PARI) N=66; x='x+O('x^N); Vec((8-x^7)/(1-x^7-x^8))
CROSSREFS
Column 7 of A306646.
Sequence in context: A085121 A228634 A229659 * A340981 A079204 A325737
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Mar 08 2019
STATUS
approved

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 April 23 07:57 EDT 2024. Contains 371905 sequences. (Running on oeis4.)