login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013987 Expansion of 1/(1-x^2-x^3-x^4-x^5-x^6-x^7-x^8-x^9-x^10). 1
1, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 54, 88, 141, 228, 367, 592, 954, 1538, 2479, 3996, 6441, 10383, 16736, 26978, 43486, 70097, 112991, 182134, 293587, 473242, 762833, 1229634, 1982084, 3194982, 5150088, 8301584, 13381575, 21570168, 34769609, 56046190 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

COMMENTS

Number of compositions of n into parts p where 2 <= p < = 10. [Joerg Arndt, Jun 24 2013]

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

R. Mullen, On Determining Paint by Numbers Puzzles with Nonunique Solutions, JIS 12 (2009) 09.6.5

MATHEMATICA

CoefficientList[Series[1 / (1 - x^2 - x^3 - x^4 - x^5 - x^6 - x^7 - x^8 - x^9 - x^10), {x, 0, 40}], x] (* Vincenzo Librandi, Jun 24 2013 *)

PROG

(MAGMA) m:=40; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!(1/(1-x^2-x^3-x^4-x^5-x^6-x^7-x^8-x^9-x^10))); // Vincenzo Librandi, Jun 24 2013

CROSSREFS

See A000045 for the Fibonacci numbers.

Sequence in context: A236768 A023439 A147660 * A261607 A261575 A261606

Adjacent sequences:  A013984 A013985 A013986 * A013988 A013989 A013990

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

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 December 16 09:06 EST 2019. Contains 330020 sequences. (Running on oeis4.)