[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A128485 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(1)=a(2)=a(3)=1; for n > 3, a(n) = lcm(a(n-1) + a(n-2), a(n-3)).
(history; published version)
#15 by OEIS Server at Sun Nov 10 05:20:50 EST 2024
LINKS

Robert Israel, <a href="/A128485/b128485_1.txt">Table of n, a(n) for n = 1..25</a>

#14 by Hugo Pfoertner at Sun Nov 10 05:20:50 EST 2024
STATUS

reviewed

approved

Discussion
Sun Nov 10
05:20
OEIS Server: Installed first b-file as b128485.txt.
#13 by Joerg Arndt at Sun Nov 10 02:29:22 EST 2024
STATUS

proposed

reviewed

#12 by Robert Israel at Sun Nov 10 00:15:56 EST 2024
STATUS

editing

proposed

#11 by Robert Israel at Sun Nov 10 00:15:19 EST 2024
LINKS

Robert Israel, <a href="/A128485/b128485_1.txt">Table of n, a(n) for n = 1..25</a>

STATUS

approved

editing

#10 by Susanna Cuyler at Sun Mar 04 17:44:05 EST 2018
STATUS

proposed

approved

#9 by Jon E. Schoenfield at Sun Mar 04 17:12:27 EST 2018
STATUS

editing

proposed

#8 by Jon E. Schoenfield at Sun Mar 04 17:12:25 EST 2018
NAME

a(1)=a(2)=a(3)=1. ; for n > 3, a(n) = LCMlcm(a(n-1) + a(n-2), a(n-3)).

MAPLE

a[1]:=1: a[2]:=1: a[3]:=1: for n from 4 to 18 do a[n]:=lcm(a[n-1]+a[n-2], a[n-3]) od: seq(a[n], n=1..18); - _# _Emeric Deutsch_, May 22 2007

STATUS

approved

editing

#7 by Charles R Greathouse IV at Wed Apr 09 10:14:39 EDT 2014
AUTHOR

Leroy Quet , May 07 2007

Discussion
Wed Apr 09
10:14
OEIS Server: https://oeis.org/edit/global/2149
#6 by N. J. A. Sloane at Wed Feb 05 20:18:32 EST 2014
AUTHOR

_Leroy Quet _ May 07 2007

Discussion
Wed Feb 05
20:18
OEIS Server: https://oeis.org/edit/global/2118