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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085697 a(n) = T(n+2)^2, where T(n) = tribonacci numbers (A000073). 6
1, 1, 4, 16, 49, 169, 576, 1936, 6561, 22201, 75076, 254016, 859329, 2907025, 9834496, 33269824, 112550881, 380757169, 1288092100, 4357584144, 14741602225, 49870482489, 168710633536, 570743986576, 1930813074369, 6531893843049 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (2,3,6,-1,0,-1)

FORMULA

G.F. ( 1-x-x^2-x^3 ) / ( (x^3+x^2+3*x-1)*(x^3-x^2-x-1) ).

a(n+6) = 2 a(n+5) + 3 a(n+4) + 6 a(n+3) - a(n+2) - a(n)

a(n) = (-A057597(n)+3*A057597(n+1)+6*A057597(n+2)+5*A113300(n+1)-A099463(n))/11 . [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 19 2008]

PROG

(Maxima) t[0]:1$

t[1]:1$

t[2]:2$

t[n]:=t[n-1]+t[n-2]+t[n-3]$

  makelist(t[n]^2, n, 0, 12); /* Emanuele Munarini, Mar 01 2011 */

CROSSREFS

Sequence in context: A202349 A188501 A173712 * A203094 A121184 A203840

Adjacent sequences:  A085694 A085695 A085696 * A085698 A085699 A085700

KEYWORD

easy,nonn

AUTHOR

Emanuele Munarini (munarini(AT)mate.polimi.it), Jul 18 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 07:10 EST 2012. Contains 205874 sequences.