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.

A103884 Square array A(n,k) read by antidiagonals: row n gives coordination sequence for lattice C_n.

Original entry on oeis.org

1, 1, 8, 1, 18, 16, 1, 32, 66, 24, 1, 50, 192, 146, 32, 1, 72, 450, 608, 258, 40, 1, 98, 912, 1970, 1408, 402, 48, 1, 128, 1666, 5336, 5890, 2720, 578, 56, 1, 162, 2816, 12642, 20256, 14002, 4672, 786, 64, 1, 200, 4482, 27008, 59906, 58728, 28610, 7392, 1026, 72
Offset: 2

Views

Author

Ralf Stephan, Feb 20 2005

Keywords

Examples

			Array begins:
  1,   8,    16,     24,      32,       40,        48, ... A022144;
  1,  18,    66,    146,     258,      402,       578, ... A010006;
  1,  32,   192,    608,    1408,     2720,      4672, ... A019560;
  1,  50,   450,   1970,    5890,    14002,     28610, ... A019561;
  1,  72,   912,   5336,   20256,    58728,    142000, ... A019562;
  1,  98,  1666,  12642,   59906,   209762,    596610, ... A019563;
  1, 128,  2816,  27008,  157184,   658048,   2187520, ... A019564;
  1, 162,  4482,  53154,  374274,  1854882,   7159170, ... A035746;
  1, 200,  6800,  97880,  822560,  4780008,  21278640, ... A035747;
  1, 242,  9922, 170610, 1690370, 11414898,  58227906, ... A035748;
  1, 288, 14016, 284000, 3281280, 25534368, 148321344, ... A035749;
  ...
Antidiagonals, T(n, k), begins as:
  1;
  1,   8;
  1,  18,   16;
  1,  32,   66,   24;
  1,  50,  192,  146,   32;
  1,  72,  450,  608,  258,   40;
  1,  98,  912, 1970, 1408,  402,  48;
  1, 128, 1666, 5336, 5890, 2720, 578, 56;
		

Crossrefs

Programs

  • Magma
    A103884:= func< n,k | k eq 0 select 1 else 2*(&+[2^j*Binomial(n-k,j+1)*Binomial(2*k-1,j) : j in [0..2*k-1]]) >;
    [A103884(n,k): k in [0..n-2], n in [2..12]]; // G. C. Greubel, May 23 2023
    
  • Mathematica
    nmin = 2; nmax = 11; t[n_, 0]= 1; t[n_, k_]:= 2n*Hypergeometric2F1[1-2k, 1-n, 2, 2]; tnk= Table[ t[n, k], {n, nmin, nmax}, {k, 0, nmax-nmin}]; Flatten[ Table[ tnk[[ n-k+1, k ]], {n, 1, nmax-nmin+1}, {k, 1, n} ] ] (* Jean-François Alcover, Jan 24 2012, after formula *)
  • SageMath
    def A103884(n,k): return 1 if k==0 else 2*sum(2^j*binomial(n-k,j+1)*binomial(2*k-1,j) for j in range(2*k))
    flatten([[A103884(n,k) for k in range(n-1)] for n in range(2,13)]) # G. C. Greubel, May 23 2023

Formula

A(n,k) = Sum_{i=1..2*k} 2^i*C(n, i)*C(2*k-1, i-1), A(n,0) = 1 (array).
G.f. of n-th row: (Sum_{i=0..n} C(2*n, 2*i)*x^i)/(1-x)^n.
T(n, k) = A(n-k, k) (antidiagonals).
T(n, n-2) = A022144(n-2).
T(n, k) = 2*(n-k)*Hypergeometric2F1([1+k-n, 1-2*k], [2], 2), T(n, 0) = 1, for n >= 2, 0 <= k <= n-2. - G. C. Greubel, May 23 2023
From Peter Bala, Jul 09 2023: (Start)
T(n,k) = [x^k] Chebyshev_T(n, (1 + x)/(1 - x)), where Chebyshev_T(n, x) denotes the n-th Chebyshev polynomial of the first kind.
T(n+1,k) = T(n+1,k-1) + 2*T(n,k) + 2*T(n,k-1) + T(n-1,k) - T(n-1,k-1). (End)

Extensions

Definition clarified by N. J. A. Sloane, May 25 2023

A142994 Crystal ball sequence for the lattice C_5.

Original entry on oeis.org

1, 51, 501, 2471, 8361, 22363, 50973, 103503, 192593, 334723, 550725, 866295, 1312505, 1926315, 2751085, 3837087, 5242017, 7031507, 9279637, 12069447, 15493449, 19654139, 24664509, 30648559, 37741809, 46091811, 55858661, 67215511, 80349081
Offset: 0

Views

Author

Peter Bala, Jul 18 2008

Keywords

Comments

The lattice C_5 consists of all integer lattice points v = (x_1,...,x_5) in Z^5 such that (x_1 + ... + x_5) is even, equipped with the taxicab type norm ||v|| = (1/2) * (|x_1| + ... + |x_5|). The crystal ball sequence of C_5 gives the number of lattice points v in C_5 with ||v|| <= n for n = 0,1,2,3,... [Bacher et al.].
Partial sums of A019561.

Examples

			a(1) = 51. The origin has norm 0. The 50 lattice points in Z^5 of norm 1 (as defined above) are +-2*e_i, 1 <= i <= 5 and (+- e_i +- e_j), 1 <= i < j <= 5, where e_1, ... , e_5 denotes the standard basis of Z^5. These 50 vectors form a root system of type C_5. Hence the sequence begins 1, 1 + 50 = 51, ... .
		

Crossrefs

Row 5 of A142992. Cf. A019561, A063496, A142993.

Programs

  • Magma
    [(2*n+1)*(32*n^4+64*n^3+88*n^2+56*n+15)/15: n in [0..30]]; // Vincenzo Librandi, Dec 16 2015
  • Maple
    a := n -> (2*n+1)*(32*n^4+64*n^3+88*n^2+56*n+15)/15: seq(a(n), n = 0..20)
  • Mathematica
    CoefficientList[Series[(1 + 45 x + 210 x^2 + 210 x^3 + 45 x^4 + x^5)/(1 - x)^6, {x, 0, 33}], x] (* or *) LinearRecurrence[{6, -15, 20, -15, 6, -1},{1, 51, 501, 2471, 8361, 22363}, 25] (* Vincenzo Librandi, Dec 16 2015 *)
  • Python
    A142994_list, m = [], [512, -768, 352, -48, 2, 1]
    for _ in range(10**2):
        A142994_list.append(m[-1])
        for i in range(5):
            m[i+1] += m[i] # Chai Wah Wu, Dec 15 2015
    

Formula

a(n) = (2*n + 1)*(32*n^4 + 64*n^3 + 88*n^2 + 56*n + 15)/15.
a(n) = Sum_{k = 0..5} binomial(10, 2*k)*binomial(n+k, 5).
a(n) = Sum_{k = 0..5} binomial(10, 2*k+1)*binomial(n+k+1/2, 5).
O.g.f.: (1 + 45*x + 210*x^2 + 210*x^3 + 45*x^4 + x^5)/(1 - x)^6 = 1/(1 - x) * T(5, (1 + x)/(1 - x)), where T(n, x) denotes the Chebyshev polynomial of the first kind.
Sum_{n >= 1} 1/(n*a(n-1)*a(n)) = 2*log(2) - 41/30.
a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6), for n > 5. - Vincenzo Librandi, Dec 16 2015
From Peter Bala, Mar 11 2024: (Start)
Sum_{k = 1..n+1} 1/(k*a(k)*a(k-1)) = 1/(51 - 3/(59 - 60/(75 - 315/(99 - ... - n^2*(4*n^2 - 1)/((2*n + 1)^2 + 2*5^2))))).
E.g.f.: exp(x)*(1 + 50*x + 400*x^2/2! + 1120*x^3/3! + 1280*x^4/4! + 512*x^5/5!).
Note that -T(10, i*sqrt(x)) = 1 + 50*x + 400*x^2 + 1120*x^3 + 1280*x^4 + 512*x^5. See A008310. (End)
Showing 1-2 of 2 results.