The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A017887 Expansion of 1/(1 - x^10 - x^11). 2
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 1, 3, 3, 1, 0, 0, 0, 0, 0, 0, 1, 4, 6, 4, 1, 0, 0, 0, 0, 0, 1, 5, 10, 10, 5, 1, 0, 0, 0, 0, 1, 6, 15, 20, 15, 6, 1, 0, 0, 0, 1, 7, 21, 35, 35, 21, 7, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,22
COMMENTS
Number of compositions (ordered partitions) of n into parts 10 and 11. - Ilya Gutkovskiy, May 27 2017
LINKS
FORMULA
a(n) = a(n-10) + a(n-11) for n > 10. - Vincenzo Librandi, Jul 01 2013
MATHEMATICA
CoefficientList[Series[1 / (1 - Total[x^Range[10, 11]]), {x, 0, 70}], x] (* Vincenzo Librandi, Jul 01 2013 *)
LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1}, {1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1}, 100] (* Harvey P. Dale, Feb 04 2015 *)
PROG
(Magma) m:=80; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!(1/(1-x^10-x^11))); /* or */ I:=[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]; [n le 11 select I[n] else Self(n-10)+Self(n-11): n in [1..80]]; // Vincenzo Librandi, Jul 01 2013
CROSSREFS
Sequence in context: A067150 A356995 A289922 * A289923 A289921 A219482
KEYWORD
nonn,easy
AUTHOR
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 May 15 08:34 EDT 2024. Contains 372538 sequences. (Running on oeis4.)