cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A362698 For n > 1, if n appears in the sequence, a(n) = a(n-1) - n if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + n. Otherwise a(n+1) = a(n)/(n+1) if (n+1)|a(n), otherwise a(n)*(n+1), a(1) = 1 and a(2) = 1*2.

Original entry on oeis.org

1, 2, 6, 24, 120, 114, 798, 6384, 57456, 574560, 6320160, 526680, 6846840, 489060, 32604, 521664, 8868288, 159629184, 8401536, 168030720, 3528645120, 160392960, 3689038080, 3689038056, 92225951400, 2397874736400, 64742617882800, 1812793300718400, 52571005720833600
Offset: 1

Views

Author

Kelvin Voskuijl, Jul 07 2023

Keywords

Examples

			a(2) = 2, as a(1) = 1 and 1 times 2 is 2.
a(6) = 114, as a(3) = 6 = n, thus a(6) = a(5) - 6 =  114.
a(7) = 798, as a(6) = 114 and 7 times 114 is 798.
		

Crossrefs

Programs

Extensions

More terms from Michael De Vlieger, Aug 30 2023