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!)
A108136 a(1)=1; a(2)=1; a(3)=1; a(n) = 3*a(n-1) + 2*a(n-2) + a(n-3). 0
1, 1, 1, 6, 21, 76, 276, 1001, 3631, 13171, 47776, 173301, 628626, 2280256, 8271321, 30003101, 108832201, 394774126, 1431989881, 5194350096, 18841804176, 68346102601, 247916266251, 899282808131, 3262027059496, 11832563061001 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
Length of steps in the 3-symbol substitution 1->{2}, 2->{3}, 3->{1,2,2,3,3,3} with characteristic polynomial: x^3 - 3*x^2 - 2*x - 1.
No term is divisible by 5. - Vladimir Joseph Stephan Orlovsky, Mar 24 2011
LINKS
FORMULA
From R. J. Mathar, Oct 14 2008: (Start)
G.f.: x*(1 - 2*x - 4*x^2)/(1 - 3*x - 2*x^2 - x^3).
a(n) = A108153(n) - 2*A108153(n-1) - 4*A108153(n-2). (End)
MATHEMATICA
LinearRecurrence[{3, 2, 1}, {1, 1, 1}, 30]
CROSSREFS
Sequence in context: A207097 A027281 A006814 * A054625 A192733 A344205
KEYWORD
nonn,easy
AUTHOR
Roger L. Bagula, Jun 05 2005
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 18 18:58 EDT 2024. Contains 371781 sequences. (Running on oeis4.)