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-2 of 2 results.

A090728 a(n) = 20*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 20.

Original entry on oeis.org

2, 20, 398, 7940, 158402, 3160100, 63043598, 1257711860, 25091193602, 500566160180, 9986232009998, 199224074039780, 3974495248785602, 79290680901672260, 1581839122784659598, 31557491774791519700, 629567996373045734402, 12559802435686123168340
Offset: 0

Views

Author

Nikolay V. Kosinov (kosinov(AT)unitron.com.ua), Jan 18 2004

Keywords

Comments

Except for the first term, positive values of x (or y) satisfying x^2 - 20xy + y^2 + 396 = 0. - Colin Barker, Feb 28 2014

Crossrefs

Programs

  • Mathematica
    a[0] = 2; a[1] = 20; a[n_] := 20a[n - 1] - a[n - 2]; Table[ a[n], {n, 0, 15}] (* Robert G. Wilson v, Jan 30 2004 *)
  • PARI
    Vec((2-20*x)/(1-20*x+x^2) + O(x^100)) \\ Colin Barker, Feb 28 2014
  • Sage
    [lucas_number2(n,20,1) for n in range(0,20)] # Zerinvary Lajos, Jun 27 2008
    

Formula

a(n) = p^n + q^n, where p = 10 + 3*sqrt(11) and q = 10 - 3*sqrt(11). - Tanya Khovanova, Feb 06 2007
G.f.: (2-20*x)/(1-20*x+x^2). - Philippe Deléham, Nov 02 2008

Extensions

More terms from Robert G. Wilson v, Jan 30 2004
More terms from Colin Barker, Feb 28 2014

A100344 Gives the i-th coefficient M(k,i) of the decomposition of the polynomials B(k,X^2) in the basis of all B(i,X), where B(i,X) is the i-th binomial polynomial: B(i,X) = X(X-1)...(X-i+1)/i! for any i > 0 and B(0,X) = 1 by definition.

Original entry on oeis.org

1, 0, 1, 2, 0, 0, 6, 18, 12, 0, 0, 4, 72, 248, 300, 120, 0, 0, 1, 123, 1322, 4800, 7800, 5880, 1680, 0, 0, 0, 126, 3864, 32550, 121212, 235200, 248640, 136080, 30240
Offset: 0

Views

Author

Jean Francis Michon, Nov 18 2004

Keywords

Comments

The binomial polynomials are a basis of the space of all polynomials and the decomposition of a polynomial in this basis is called its Mahler's expansion. So the sequence gives the Mahler's expansion of the binomial polynomials composed with "squaring".
For example:
B(0,X^2) = 1*B(0,X)
B(1,X^2) = 0*B(0,X)+1*B(1,X)+2*B(2,X)
B(2,X^2) = 0*B(0,X)+0*B(1,X)+6*B(2,X)+18*B(3,X)+12*B(4,X)
The coefficients may be written in a "Pascal's triangle" arrangement:
1
0 1 2
0 0 6 18 12
0 0 4 72 248 300 120
0 0 1 1 123 1322 4800 7800 5880 1680
They are always < binomial(i^2, k) or equal to it when i^2+1 > k > (i-1)^2. They are 0 if i > 2k or k > i^2.
They have a combinatorial interpretation if i > 0. Let the set I={1,...,i} and I X I the set of pairs, M(k,i) is the number of subsets with k pairs in I X I such that any element of I appears as a coordinate in at least one pair.
Example: M(2,2) = 6 because all subsets with 2 elements in IxI = {(1,1),(1,2),(2,1),(2,2)} satisfy the property and there are 6 such subsets.
The M(k,i) sequence allows the enumeration of quasi-reduced ordered binary decision diagram (QROBDD) canonically associated to Boolean functions (see references).

Examples

			M(2,2)=6 because B(2,X^2) = 0*B(0,X) + 0*B(1,X) + 6*B(2,X) + 18*B(3,X) + 12*B(4,X).
		

Crossrefs

Cf. for binomial polynomials: A080959.

Formula

M(0, 0) = 1 and, for all i > 0, M(0, i) = 0. Let M(k, i) = 0 if all i < 0 and all k for ease. Then, for all k > 0, i > 0: M(k, i)= [(i^2-k+1)M(k-1, i) + i(2i-1)M(k-1, i-1) + i(i-1)M(k-1, i-2) ]/k.
Showing 1-2 of 2 results.