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.

A188377 a(n) = n^3 - 4n^2 + 6n - 2.

Original entry on oeis.org

7, 22, 53, 106, 187, 302, 457, 658, 911, 1222, 1597, 2042, 2563, 3166, 3857, 4642, 5527, 6518, 7621, 8842, 10187, 11662, 13273, 15026, 16927, 18982, 21197, 23578, 26131, 28862, 31777, 34882, 38183, 41686, 45397, 49322, 53467, 57838, 62441, 67282, 72367
Offset: 3

Views

Author

Adeniji, Adenike & Makanjuola, Samuel (somakanjuola(AT)unilorin.edu.ng) Apr 14 2011

Keywords

Comments

Number of nilpotent elements in the identity difference partial one - one transformation semigroup, denoted by N(IDI_n). For n=3, #N(IDI_n) = 7.
a(n+1) is also the Moore lower bound on the order of an (n,7)-cage. - Jason Kimberley, Oct 20 2011

Crossrefs

Moore lower bound on the order of a (k,g) cage: A198300 (square); rows: A000027 (k=2), A027383 (k=3), A062318 (k=4), A061547 (k=5), A198306 (k=6), A198307 (k=7), A198308 (k=8), A198309 (k=9), A198310 (k=10), A094626 (k=11); columns: A020725 (g=3), A005843 (g=4), A002522 (g=5), A051890 (g=6), this sequence (g=7). - Jason Kimberley, Oct 30 2011

Programs

Formula

a(n+1) = (n+1)^3 - 4*(n+1)^2 + 6*(n+1) - 2
= (n-1)^3 + 2*(n-1)^2 + 2*(n-1) + 2
= 1222 read in base n-1.
- Jason Kimberley, Oct 20 2011
From Colin Barker, Apr 06 2012: (Start)
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4).
G.f.: x^3*(7 - 6*x + 7*x^2 - 2*x^3)/(1-x)^4. (End)
E.g.f.: 2 - x - x^2 + exp(x)*(x^3 - x^2 + 3*x - 2). - Stefano Spezia, Apr 09 2022

Extensions

Edited by N. J. A. Sloane, Apr 23 2011