Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085697
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085697 a(n) = T(n+2)^2, where T(n) = tribonacci numbers (A000073). +0
3
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; listen)
OFFSET

0,3

FORMULA

G.F. : ( 1 - t - t^2 - t^3 )/( 1 - 2 t - 3 t^2 - 6 t^3 + t^4 + t^6 ) Recurrence : 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]

CROSSREFS

Sequence in context: A119005 A086601 A114185 this_sequence A121184 A089093 A058234

Adjacent sequences: A085694 A085695 A085696 this_sequence A085698 A085699 A085700

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research