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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075536 a(n) = (1/2)((-1)^n+1)T(n)+(1/2)(-(-1)^n+1)S(n), where T(n) = tribonacci numbers A000073, S(n) = generalized tribonacci numbers A001644. 1
0, 1, 1, 7, 4, 21, 13, 71, 44, 241, 149, 815, 504, 2757, 1705, 9327, 5768, 31553, 19513, 106743, 66012, 361109, 223317, 1221623, 755476, 4132721, 2555757, 13980895, 8646064, 47297029, 29249425, 160004703, 98950096, 541292033, 334745777 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

a(n)=T(n) if n even, a(n)=S(n) if n odd.

LINKS

Table of n, a(n) for n=0..34.

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

FORMULA

a(n)=3a(n-2)+a(n-4)+a(n-6), a(0)=0, a(1)=1, a(2)=1, a(3)=7, a(4)=4, a(5)=21. Ogf (x + x^2 + 4x^3 + x^4 - x^5)/(1 - 3x^2 - x^4 - x^6).

MATHEMATICA

CoefficientList[Series[(x+x^2+4x^3+x^4-x^5)/(1-3x^2-x^4-x^6), {x, 0, 40}], x]

LinearRecurrence[{0, 3, 0, 1, 0, 1}, {0, 1, 1, 7, 4, 21}, 40] (* Harvey P. Dale, Jul 10 2012 *)

CROSSREFS

Cf. A000073, A001644, A005013, A005247.

Sequence in context: A181138 A063632 A147601 * A085047 A213831 A213564

Adjacent sequences:  A075533 A075534 A075535 * A075537 A075538 A075539

KEYWORD

easy,nonn

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Sep 23 2002

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 4 19:20 EST 2016. Contains 278755 sequences.