Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104470
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104470 Tribonacci-equivalent of mousetrap sequence (A002467). +0
1
1, 1, 1, 9, 44, 270, 1938, 15764, 143776, 1453302, 16128420, 194980478, 2550746400, 35904118874, 541097840528, 8693290587030, 148324680742912, 2678504175897990, 51039398650102776, 1023458322628129882 (list; graph; listen)
OFFSET

0,4

COMMENT

The mousetrap sequence (A002467) can be defined in a Fibonacci-like way as: a(0) = a(1) = 1; for n>1 a(n) = n*(a(n-1)+a(n-2)). The current sequence is thus the tribonacci-equivalent of that.

FORMULA

a(0) = a(1) = a(2) = 1; for n>2 a(n) = n*(a(n-1)+a(n-2)+a(n-3)).

CROSSREFS

Cf. A002467.

Sequence in context: A084903 A034558 A099867 this_sequence A084016 A125679 A037207

Adjacent sequences: A104467 A104468 A104469 this_sequence A104471 A104472 A104473

KEYWORD

easy,nonn

AUTHOR

Jonathan Vos Post (jvospost2(AT)yahoo.com), Mar 09 2005

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research