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.

Showing 1-4 of 4 results.

A052928 The even numbers repeated.

Original entry on oeis.org

0, 0, 2, 2, 4, 4, 6, 6, 8, 8, 10, 10, 12, 12, 14, 14, 16, 16, 18, 18, 20, 20, 22, 22, 24, 24, 26, 26, 28, 28, 30, 30, 32, 32, 34, 34, 36, 36, 38, 38, 40, 40, 42, 42, 44, 44, 46, 46, 48, 48, 50, 50, 52, 52, 54, 54, 56, 56, 58, 58, 60, 60, 62, 62, 64, 64, 66, 66, 68, 68, 70, 70, 72, 72
Offset: 0

Views

Author

encyclopedia(AT)pommard.inria.fr, Jan 25 2000

Keywords

Comments

a(n) is also the binary rank of the complete graph K(n). - Alessandro Cosentino (cosenal(AT)gmail.com), Feb 07 2009
Let I=I_n be the n X n identity matrix and P=P_n be the incidence matrix of the cycle (1,2,3,...,n). Then, for n >= 6, a(n) is the number of (0,1) n X n matrices A <= P^(-1)+I+P having exactly two 1's in every row and column with perA=2. - Vladimir Shevelev, Apr 12 2010
a(n+2) is the number of symmetry allowed, linearly independent terms at n-th order in the series expansion of the (E+A)xe vibronic perturbation matrix, H(Q) (cf. Eisfeld & Viel). - Bradley Klee, Jul 21 2015
The arithmetic function v_2(n,1) as defined in A289187. - Robert Price, Aug 22 2017
For n > 1, also the chromatic number of the n X n white bishop graph. - Eric W. Weisstein, Nov 17 2017
For n > 2, also the maximum vertex degree of the n-polygon diagonal intersection graph. - Eric W. Weisstein, Mar 23 2018
For n >= 2, a(n+2) gives the minimum weight of a Boolean function of algebraic degree at most n-2 whose support contains n linearly independent elements. - Christof Beierle, Nov 25 2019

References

  • C. D. Godsil and G. Royle, Algebraic Graph Theory, Springer, 2001, page 181. - Alessandro Cosentino (cosenal(AT)gmail.com), Feb 07 2009
  • V. S. Shevelyov (Shevelev), Extension of the Moser class of four-line Latin rectangles, DAN Ukrainy, 3(1992),15-19.

Crossrefs

First differences: A010673; partial sums: A007590; partial sums of partial sums: A212964(n+1).
Complement of A109613 with respect to universe A004526. - Guenther Schrack, Dec 07 2017
Is first differences of A099392. Fixed point sequence: A005843. - Guenther Schrack, May 30 2019
For n >= 3, A329822(n) gives the minimum weight of a Boolean function of algebraic degree at most n-3 whose support contains n linearly independent elements. - Christof Beierle, Nov 25 2019

Programs

  • Haskell
    a052928 = (* 2) . flip div 2
    a052928_list = 0 : 0 : map (+ 2) a052928_list
    -- Reinhard Zumkeller, Jun 20 2015
  • Magma
    [2*Floor(n/2) : n in [0..50]]; // Wesley Ivan Hurt, Sep 13 2014
    
  • Maple
    spec := [S,{S=Union(Sequence(Prod(Z,Z)),Prod(Sequence(Z),Sequence(Z)))},unlabeled]: seq(combstruct[count](spec,size=n), n=0..20);
  • Mathematica
    Flatten[Table[{2n, 2n}, {n, 0, 39}]] (* Alonso del Arte, Jun 24 2012 *)
    With[{ev=2Range[0,40]},Riffle[ev,ev]] (* Harvey P. Dale, May 08 2021 *)
    Table[Round[n + 1/2], {n, -1, 72}] (* Ed Pegg Jr, Jul 28 2025 *)
  • PARI
    a(n)=n\2*2 \\ Charles R Greathouse IV, Nov 20 2011
    

Formula

a(n) = 2*floor(n/2).
G.f.: 2*x^2/((-1+x)^2*(1+x)).
a(n) + a(n+1) + 2 - 2*n = 0.
a(n) = n - 1/2 + (-1)^n/2.
a(n) = n + Sum_{k=1..n} (-1)^k. - William A. Tedeschi, Mar 20 2008
a(n) = a(n-1) + a(n-2) - a(n-3). - R. J. Mathar, Feb 19 2010
a(n) = |A123684(n) - A064455(n)| = A032766(n) - A008619(n-1). - Jaroslav Krizek, Mar 22 2011
For n > 0, a(n) = floor(sqrt(n^2+(-1)^n)). - Francesco Daddi, Aug 02 2011
a(n) = Sum_{k>=0} A030308(n,k)*b(k) with b(0)=0 and b(k)=2^k for k>0. - Philippe Deléham, Oct 19 2011
a(n) = A109613(n) - 1. - M. F. Hasler, Oct 22 2012
a(n) = n - (n mod 2). - Wesley Ivan Hurt, Jun 29 2013
a(n) = a(a(n-1)) + a(n-a(n-1)) for n>2. - Nathan Fox, Jul 24 2016
a(n) = 2*A004526(n). - Filip Zaludek, Oct 28 2016
E.g.f.: x*exp(x) - sinh(x). - Ilya Gutkovskiy, Oct 28 2016
a(-n) = -a(n+1); a(n) = A005843(A004526(n)). - Guenther Schrack, Sep 11 2018
From Guenther Schrack, May 29 2019: (Start)
a(b(n)) = b(n) + ((-1)^b(n) - 1)/2 for any sequence b(n) of offset 0.
a(a(n)) = a(n), idempotent.
a(A086970(n)) = A124356(n-1) for n > 1.
a(A000124(n)) = A192447(n+1).
a(n)*a(n+1)/2 = A007590(n), also equals partial sums of a(n).
A007590(a(n)) = 2*A008794(n). (End)

Extensions

More terms from James Sellers, Jun 05 2000
Removed duplicate of recurrence; corrected original recurrence and g.f. against offset - R. J. Mathar, Feb 19 2010

A118265 Coefficient of q^n in (1-q)^4/(1-4q); dimensions of the enveloping algebra of the derived free Lie algebra on 4 letters.

Original entry on oeis.org

1, 0, 6, 20, 81, 324, 1296, 5184, 20736, 82944, 331776, 1327104, 5308416, 21233664, 84934656, 339738624, 1358954496, 5435817984, 21743271936, 86973087744, 347892350976, 1391569403904, 5566277615616, 22265110462464, 89060441849856
Offset: 0

Views

Author

Mike Zabrocki, Apr 20 2006

Keywords

Comments

For n>=4, a(n) is equal to the number of functions f:{1,2,...,n}->{1,2,3,4} such that for fixed, different x_1, x_2, x_3, x_4 in {1,2,...,n} and fixed y_1, y_2, y_3, y_ 4 in {1,2,3,4} we have f(x_i)<>y_i, (i=1,2,3,4). - Milan Janjic, May 13 2007
Also the number of monic polynomials of degree n over GF(4) without any linear factors. - Greyson C. Wesley, Jul 05 2022

Examples

			The enveloping algebra of the derived free Lie algebra is characterized as the intersection of the kernels of all partial derivative operators in the space of non-commutative polynomials, a(0) = 1 since all constants are killed by derivatives, a(1) = 0 since no polys of degree 1 are killed, a(2) = 6 since all Lie brackets [x1,x2], [x1,x3], [x1, x4], [x2,x3], [x2,x4], [x3,x4] are killed by all derivative operators.
		

References

  • C. Reutenauer, Free Lie algebras. London Mathematical Society Monographs. New Series, 7. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1993. xviii+269 pp.

Crossrefs

Programs

  • Maple
    f:=n->add((-1)^k*C(4,k)*4^(n-k),k=0..min(n,4)); seq(f(i),i=0..15);
  • Mathematica
    a[n_] := If[n<4, {1, 0, 6, 20}[[n+1]], 81*4^(n-4)];
    Table[a[n], {n, 0, 24}] (* Jean-François Alcover, Dec 10 2018 *)

Formula

G.f.: (1-q)^4/(1-4q).
a(n) = Sum_{k=0..min(n,4)} (-1)^k*C(4,k)*4^(n-k).
a(n) = 81*4^(n-4) for n>3. - Jean-François Alcover, Dec 10 2018

A118264 Coefficient of q^n in (1-q)^3/(1-3q); dimensions of the enveloping algebra of the derived free Lie algebra on 3 letters.

Original entry on oeis.org

1, 0, 3, 8, 24, 72, 216, 648, 1944, 5832, 17496, 52488, 157464, 472392, 1417176, 4251528, 12754584, 38263752, 114791256, 344373768, 1033121304, 3099363912, 9298091736, 27894275208, 83682825624, 251048476872, 753145430616
Offset: 0

Views

Author

Mike Zabrocki, Apr 20 2006

Keywords

Comments

a(n) is the number of generalized compositions of n when there are i^2-1 different types of i, (i=1,2,...). - Milan Janjic, Sep 24 2010

Examples

			The enveloping algebra of the derived free Lie algebra is characterized as the intersection of the kernels of all partial derivative operators in the space of non-commutative polynomials, a(0) = 1 since all constants are killed by derivatives, a(1) = 0 since no polys of degree 1 are killed, a(2) = 3 since all Lie brackets [x1,x2], [x1,x3], [x2, x3] are killed by all derivative operators.
		

References

  • C. Reutenauer, Free Lie algebras. London Mathematical Society Monographs. New Series, 7. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1993. xviii+269 pp.

Crossrefs

Programs

  • Maple
    f:=n->coeftayl((1-q)^3/(1-3*q),q=0,n):seq(f(i),i=0..15);
  • Mathematica
    CoefficientList[Series[(1-q)^3/(1-3q),{q,0,30}],q] (* or *) Join[{1,0,3}, NestList[3#&,8,30]] (* Harvey P. Dale, Jun 28 2011 *)
    Join[{1, 0, 3}, LinearRecurrence[{3}, {8}, 24]] (* Jean-François Alcover, Sep 23 2017 *)

Formula

G.f.: (1-x)^3/(1-3x).
a(n) = 3^{n-1}-3^{n-3} for n>=3.
a(n) = A080923(n-1), n>1.
If p[i]=i^2-1 and if A is Hessenberg matrix of order n defined by: A[i,j]=p[j-i+1], (i<=j), A[i,j]=-1, (i=j+1), and A[i,j]=0 otherwise. Then, for n>=1, a(n)=det A. - Milan Janjic, May 02 2010
For a(n)>=8, a(n+1)=3*a(n). - Harvey P. Dale, Jun 28 2011

Extensions

Formula corrected Mike Zabrocki, Jul 22 2010

A122394 Dimension of 5-variable non-commutative harmonics (Hausdorff derivative). The dimension of the space of non-commutative polynomials in 5 variables which are killed by all symmetric differential operators (where for a monomial w, d_{xi} ( w ) = sum over all subwords of w deleting xi once).

Original entry on oeis.org

1, 4, 19, 95, 475, 2376, 11881, 59406, 297029, 1485144, 7425719, 37128595, 185642975, 928214876, 4641074381, 23205371904, 116026859520, 580134297600, 2900671488000, 14503357440000, 72516787200000, 362583936000000
Offset: 0

Views

Author

Mike Zabrocki, Aug 31 2006

Keywords

Examples

			a(1) = 4 because x1 - x2, x2 - x3, x3 - x4, x4 - x5 are all killed by d_x1+d_x2+d_x3+d_x4+d_x5
		

References

  • C. Chevalley, Invariants of finite groups generated by reflections, Amer. J. Math. 77 (1955), 778-782.
  • C. Reutenauer, Free Lie algebras. London Mathematical Society Monographs. New Series, 7. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1993. xviii+269 pp.

Crossrefs

Programs

  • Maple
    coeffs(convert(series(mul(1-q^i,i=1..5)/(1-5*q),q,20),`+`)-O(q^20),q);

Formula

G.f.: (1-q)*(1-q^2)*(1-q^3)*(1-q^4)*(1-q^5)/(1-5*q) a(n) = 23205371904*5^(n-15) for n>14
Showing 1-4 of 4 results.