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.

A245962 Triangle read by rows: T(n,k) is the number of induced subgraphs of the Lucas cube Lambda(n) that are isomorphic to the hypercube Q(k).

Original entry on oeis.org

1, 1, 3, 2, 4, 3, 7, 8, 2, 11, 15, 5, 18, 30, 15, 2, 29, 56, 35, 7, 47, 104, 80, 24, 2, 76, 189, 171, 66, 9, 123, 340, 355, 170, 35, 2, 199, 605, 715, 407, 110, 11, 322, 1068, 1410, 932, 315, 48, 2, 521, 1872, 2730, 2054, 832, 169, 13, 843, 3262, 5208, 4396, 2079, 532, 63, 2
Offset: 0

Views

Author

Emeric Deutsch, Aug 14 2014

Keywords

Comments

Number of entries in row n is 1 + floor(n/2).
The entries in row n are the coefficients of the cube polynomial of the Lucas cube Lambda(n).
For n >= 1, sum of entries in row n = A014551(n) = 2^n + (-1)^n (the Jacobsthal-Lucas numbers).
Sum_{k >= 0} k*T(n,k) = A099429(n).
T(n,0) = A000032(n) (n >= 1; the Lucas numbers); T(n,1) = A099920(n-1); T(n,2) = A245961(n).
As communicated by the authors, Theorem 5.2 and Corollary 5.3 of the Klavzar et al. paper contains a typo: 2nd binomial should be binomial(n - a - 1, a) resp. binomial(n - i - 1, i).

Examples

			Row 4 is 7, 8, 2. Indeed, the Lucas cube Lambda(4) is the graph <><> obtained by identifying a vertex of a square with a vertex of another square; it has 7 vertices (i.e., Q(0)s), 8 edges (i.e., Q(1)s), and 2 squares (i.e., Q(2)s).
Triangle starts:
   1;
   1;
   3,  2;
   4,  3;
   7,  8,  2;
  11, 15,  5;
		

Crossrefs

Programs

  • Maple
    T := proc (n, k) options operator, arrow: add((2*binomial(n-i, i)-binomial(n-i-1, i))*binomial(i, k), i = k .. floor((1/2)*n)) end proc: for n from 0 to 20 do seq(T(n, k), k = 0 .. (1/2)*n) end do; # yields sequence in triangular form
  • Mathematica
    A245962[n_, k_] := Sum[(2*Binomial[n-i, i]-Binomial[n-i-1, i])*Binomial[i, k], {i, k, n/2}]; Table[A245962[n, k], {n, 0, 15}, {k, 0, n/2}] (* Paolo Xausa, Feb 29 2024 *)

Formula

T(n,k) = Sum_{i = k..floor(n/2)} (2*binomial(n - i, i) - binomial(n - i - 1, i))*binomial(i, k).
G.f.: (1+(1+t)*z^2)/(1-z-(1+t)*z^2).
The generating polynomial of row n (i.e., the cube polynomial of Lambda(n)) is Sum_{i = 0..floor(n/2)} (2*binomial(n - i, i) - binomial(n - i - 1))(1+x)^i.
The generating polynomial of row n (i.e., the cube polynomial of Lambda(n)) is ((1+w)/2)^n + ((1-w)/2)^n, where w = sqrt(5 + 4x).
The generating function of column k (k >= 1) is z^(2k)(2-z)/(1-z-z^2)^(k+1).

A364605 Number of 6-cycles in the n-Lucas cube graph.

Original entry on oeis.org

0, 0, 0, 0, 5, 44, 147, 464, 1236, 3100, 7293, 16472, 35919, 76216, 158040, 321472, 643229, 1268868, 2472147, 4764120, 9092300, 17202636, 32294277, 60199088, 111498175, 205306192, 376014960, 685273120, 1243205205, 2245893340, 4041415347, 7245914176, 12947137412
Offset: 1

Views

Author

Eric W. Weisstein, Jul 30 2023

Keywords

Crossrefs

Cf. A245961 (number of 4-cycles).

Programs

  • Mathematica
    Join[{0}, Table[(n + 1) (3 (40 n^2 - 145 n + 99) Fibonacci[n] - (40 n^2 - 133 n + 75) LucasL[n])/150, {n, 20}]]
    Join[{0}, LinearRecurrence[{4, -2, -8, 5, 8, -2, -4, -1}, {0, 0, 0, 5, 44, 147, 464, 1236}, 20]]
    CoefficientList[Series[x^4 (5 + 24 x - 19 x^2 + 4 x^3 + x^4)/(-1 + x + x^2)^4, {x, 0, 20}], x]

Formula

a(n) = (n + 1)*(3*(40n^2 - 145*n + 99)*A000045(n) - (40*n^2 - 133*n + 75)*A000032(n))/150.
a(n) = 4*a(n-1) - 2*a(n-2) - 8*a(n-3) + 5*a(n-4) + 8*a(n-5) - 2*a(n-6) - 4*a(n-7) - a(n-8) for n > 1.
G.f.: x^4*(5+24*x-19*x^2+4*x^3+x^4)/(-1+x+x^2)^4.
Showing 1-2 of 2 results.