A127841 a(1)=1, a(2)=...=a(7)=0, a(n) = a(n-7)+a(n-6) for n>7.

1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 1, 3, 3, 1, 0, 0, 1, 4, 6, 4, 1, 0, 1, 5, 10, 10, 5, 1, 1, 6, 15, 20, 15, 6, 2, 7, 21, 35, 35, 21, 8, 9, 28, 56, 70, 56, 29, 17, 37, 84, 126, 126, 85, 46, 54, 121, 210, 252, 211

Offset

1,21

Comments

Part of the phi_k family of sequences defined by a(1)=1,a(2)=...=a(k)=0, a(n)=a(n-k)+a(n-k+1) for n>k. phi_2 is a shift of the Fibonacci sequence and phi_3 is a shift of the Padovan sequence.

Apart from offset same as A017847. - Georg Fischer, Oct 07 2018

References

S. Suter, Binet-like formulas for recurrent sequences with characteristic equation x^k=x+1, preprint, 2007. [Apparently unpublished as of May 2016]

Links

Colin Barker, Table of n, a(n) for n = 1..1000

Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,1,1).

Formula

Binet-like formula: a(n) = Sum_{i=1..7} (r_i^n)/(6(r_i)^2+7(r_i)) where r_i is a root of x^7=x+1.

G.f.: x*(1-x)*(1+x)*(1-x+x^2)*(1+x+x^2) / (1-x^6-x^7). - Colin Barker, May 30 2016

Mathematica

CoefficientList[Series[(1-x)*(1+x)*(1-x+x^2)*(1+x+x^2) / (1-x^6-x^7), {x, 0, 50}], x] (* or *)
LinearRecurrence[{0, 0, 0, 0, 0, 1, 1}, {1, 0, 0, 0, 0, 0, 0}, 50] (* Stefano Spezia, Oct 08 2018 *)

Prog

(PARI) Vec(x*(1-x)*(1+x)*(1-x+x^2)*(1+x+x^2)/(1-x^6-x^7) + O(x^100)) \\ Colin Barker, May 30 2016
(GAP) a:=[1, 0, 0, 0, 0, 0, 0];;  for n in [8..80] do a[n]:=a[n-6]+a[n-7]; od; a; # Muniru A Asiru, Oct 07 2018

Crossrefs

Sequence in context: A186084 A301345 A047998 * A017847 A350753 A091006

Adjacent sequences: A127838 A127839 A127840 * A127842 A127843 A127844

Keyword

nonn,easy

Author

Stephen Suter (sms5064(AT)psu.edu), Apr 02 2007

Status

approved