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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A143456 Expansion of 1/(x^k*(1-x-3*x^(k+1))) for k=5. 3
1, 4, 7, 10, 13, 16, 19, 31, 52, 82, 121, 169, 226, 319, 475, 721, 1084, 1591, 2269, 3226, 4651, 6814, 10066, 14839, 21646, 31324, 45277, 65719, 95917, 140434, 205372, 299344, 435175, 632332, 920083, 1341385, 1957501, 2855533, 4161058, 6058054 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

a(n) is also the number of length n quaternary words with at least 5 0-digits between any other digits.

LINKS

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

FORMULA

G.f.: 1/(x^5*(1-x-3*x^6)).

MAPLE

a:= proc(k::nonnegint) local n, i, j; if k=0 then unapply(4^n, n) else unapply((Matrix(k+1, (i, j)-> if (i=j-1) or j=1 and i=1 then 1 elif j=1 and i=k+1 then 3 else 0 fi)^(n+k))[1, 1], n) fi end(5): seq(a(n), n=0..52);

MATHEMATICA

Series[1/(1-x-3*x^6), {x, 0, 52}] // CoefficientList[#, x]& // Drop[#, 5]& (* Jean-Fran├žois Alcover, Feb 13 2014 *)

CROSSREFS

5th column of A143461.

Sequence in context: A046956 A198265 A310681 * A310682 A090852 A182112

Adjacent sequences:  A143453 A143454 A143455 * A143457 A143458 A143459

KEYWORD

nonn,easy

AUTHOR

Alois P. Heinz, Aug 16 2008

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 04:19 EST 2018. Contains 318158 sequences. (Running on oeis4.)