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.

A066830 a(n) = lcm(n+1, n-1).

Original entry on oeis.org

0, 3, 4, 15, 12, 35, 24, 63, 40, 99, 60, 143, 84, 195, 112, 255, 144, 323, 180, 399, 220, 483, 264, 575, 312, 675, 364, 783, 420, 899, 480, 1023, 544, 1155, 612, 1295, 684, 1443, 760, 1599, 840, 1763, 924, 1935, 1012, 2115, 1104, 2303, 1200, 2499, 1300
Offset: 1

Views

Author

Benoit Cloitre, Jan 20 2002

Keywords

Comments

a(n+2) is the order of rowmotion on a poset obtained by adjoining a unique minimal and maximal element to a disjoint union of at least two chains of n elements. - Nick Mayers, Jun 01 2018

Crossrefs

Programs

Formula

a(2n) = A000466(n); a(2n+1) = A046092(n).
From Colin Barker, Nov 05 2014: (Start)
a(n) = 3*a(n-2) - 3*a(n-4) + a(n-6) for n > 6.
a(n) = (3+(-1)^n)*(-1+n^2)/4.
G.f.: x^2*(x^4 - 6*x^2 - 4*x - 3) / ((x-1)^3*(x+1)^3). (End)
From Amiram Eldar, Aug 09 2022: (Start)
a(n) = numerator((n^2 - 1)/2).
Sum_{n>=2} 1/a(n) = 1. (End)
E.g.f.: (2 - (2 - x - 2*x^2)*cosh(x) - (1 - 2*x - x^2)*sinh(x))/2. - Stefano Spezia, Aug 04 2025