The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A104470

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A104470

Tribonacci equivalent of mousetrap sequence (A002467).
(history; published version)

#10 by Harvey P. Dale at Tue Dec 25 12:51:06 EST 2018

STATUS

editing

approved

#9 by Harvey P. Dale at Tue Dec 25 12:51:01 EST 2018

LINKS

Harvey P. Dale, <a href="/A104470/b104470.txt">Table of n, a(n) for n = 0..449</a>

STATUS

approved

editing

#8 by Harvey P. Dale at Tue Dec 25 12:49:24 EST 2018

STATUS

editing

approved

#7 by Harvey P. Dale at Tue Dec 25 12:49:21 EST 2018

MATHEMATICA

RecurrenceTable[{a[0]==a[1]==a[2]==1, a[n]==n(a[n-1]+a[n-2]+a[n-3])}, a, {n, 20}] (* Harvey P. Dale, Dec 25 2018 *)

STATUS

approved

editing

#6 by Susanna Cuyler at Wed Apr 18 23:45:11 EDT 2018

STATUS

proposed

approved

#5 by Jon E. Schoenfield at Wed Apr 18 20:36:01 EDT 2018

STATUS

editing

proposed

#4 by Jon E. Schoenfield at Wed Apr 18 20:35:58 EDT 2018

NAME

Tribonacci- equivalent of mousetrap sequence (A002467).

COMMENTS

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.

STATUS

approved

editing

#3 by Russ Cox at Fri Mar 30 18:40:27 EDT 2012

AUTHOR

_Jonathan Vos Post (jvospost3(AT)gmail.com), _, Mar 09 2005

Discussion

Fri Mar 30

18:40

OEIS Server: https://oeis.org/edit/global/228

#2 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009

KEYWORD

easy,nonn,new

AUTHOR

Jonathan Vos Post (jvospost2jvospost3(AT)yahoogmail.com), Mar 09 2005

#1 by N. J. A. Sloane at Sat Apr 09 03:00:00 EDT 2005

NAME

Tribonacci-equivalent of mousetrap sequence (A002467).

DATA

1, 1, 1, 9, 44, 270, 1938, 15764, 143776, 1453302, 16128420, 194980478, 2550746400, 35904118874, 541097840528, 8693290587030, 148324680742912, 2678504175897990, 51039398650102776, 1023458322628129882

OFFSET

0,4

COMMENTS

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.

KEYWORD

easy,nonn

AUTHOR

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

STATUS

approved