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.

Previous Showing 21-30 of 93 results. Next

A195848 Expansion of 1 / f(-x^1, -x^5) in powers of x where f() is Ramanujan's two-variable theta function.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 3, 4, 4, 4, 5, 7, 10, 12, 13, 14, 16, 21, 27, 32, 35, 38, 44, 54, 67, 78, 86, 94, 107, 128, 153, 176, 194, 213, 241, 282, 331, 376, 415, 456, 512, 590, 680, 767, 845, 928, 1037, 1180, 1345, 1506, 1657, 1818, 2020, 2278, 2570, 2862, 3142, 3442
Offset: 0

Views

Author

Omar E. Pol, Sep 24 2011

Keywords

Comments

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Also column 4 of A195825, therefore this sequence contains two plateaus: [1, 1, 1, 1, 1], [4, 4, 4]. For more information see A210843 and other sequences of this family. - Omar E. Pol, Jun 26 2012
The number of partitions of n into parts congruent to 0, 1 or 5 ( mod 6 ). - Peter Bala, Dec 09 2020

Examples

			G.f. = 1 + x + x^2 + x^3 + x^4 + 2*x^5 + 3*x^6 + 4*x^7 + 4*x^8 + 4*x^9 + 5*x^10 + ...
G.f. = 1/q + q^2 + q^5 + q^8 + q^11 + 2*q^14 + 3*q^17 + 4*q^20 + 4*q^23 + 4*q^26 + ...
		

Crossrefs

Column 1 of triangle A195838. Also 1 together with the row sums of triangle A195838. Column 4 of array A195825.
Cf. A089802.

Programs

  • Maple
    A001082 := proc(n)
            if type(n,'even') then
                    n*(3*n-4)/4 ;
            else
                    (n-1)*(3*n+1)/4 ;
            end if;
    end proc:
    A195838 := proc(n,k)
            option remember;
            local ks,a,j ;
            if A001082(k+1) > n then
                    0 ;
            elif n <= 5 then
                    return 1;
            elif k = 1 then
                    a := 0 ;
                    for j from 1 do
                            if A001082(j+1) <= n-1 then
                                    a := a+procname(n-1,j) ;
                            else
                                    break;
                            end if;
                    end do;
                    return a;
            else
                    ks := A001082(k+1) ;
                    (-1)^floor((k-1)/2)*procname(n-ks+1,1) ;
            end if;
    end proc:
    A195848 := proc(n)
            A195838(n+1,1) ;
    end proc:
    seq(A195848(n),n=0..60) ; # R. J. Mathar, Oct 07 2011
  • Mathematica
    a[ n_] := SeriesCoefficient[ QPochhammer[ x^2] QPochhammer[ x^3] / (QPochhammer[ x] QPochhammer[ x^6]^2), {x, 0, n}]; (* Michael Somos, Oct 18 2014 *)
    a[ n_] := SeriesCoefficient[ 2 q^(3/8) / (QPochhammer[ q, q^2] EllipticTheta[ 2, 0, q^(3/2)]), {q, 0, n}]; (* Michael Somos, Oct 18 2014 *)
    nmax = 60; CoefficientList[Series[Product[(1+x^k) / ((1+x^(3*k)) * (1-x^(6*k))), {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Nov 08 2015 *)
  • PARI
    {a(n) = local(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x^2 + A) * eta(x^3 + A) / (eta(x + A) * eta(x^6 + A)^2), n))}; /* Michael Somos, Jun 07 2012 */
    From Omar E. Pol, Jun 10 2012: (Start)
    (GW-BASIC)' A program with two A-numbers:
    10 Dim A001082(100), A057077(100), a(100): a(0)=1
    20 For n = 1 to 58: For j = 1 to n
    30 If A001082(j) <= n then a(n) = a(n) + A057077(j-1)*a(n - A001082(j))
    40 Next j: Print a(n-1);: Next n (End)

Formula

Expansion of 1 / (psi(x^3) * chi(-x)) in powers of x where psi(), chi() are Ramanujan theta functions. - Michael Somos, Jun 07 2012
Expansion of q^(1/3) * eta(q^2) * eta(q^3) / (eta(q) * eta(q^6)^2) in powers of q. - Michael Somos, Jun 07 2012
Euler transform of period 6 sequence [ 1, 0, 0, 0, 1, 1, ...]. - Michael Somos, Oct 18 2014
Convolution inverse of A089802. - Michael Somos, Oct 18 2014
a(n) ~ exp(Pi*sqrt(n/3))/(4*n). - Vaclav Kotesovec, Nov 08 2015
a(n) = (1/n)*Sum_{k=1..n} A284362(k)*a(n-k), a(0) = 1. - Seiichi Manyama, Mar 25 2017
From Peter Bala, Dec 09 2020: (Start)
O.g.f.: 1/( Product_{n >= 1} (1 - x^(6*n-5))*(1 - x^(6*n-1))*(1 - x^(6*n)) ).
a(n) = a(n-1) + a(n-5) - a(n-8) - a(n-16) + + - - ... (with the convention a(n) = 0 for negative n), where 1, 5, 8, 16, ... is the sequence of generalized octagonal numbers A001082. (End)

Extensions

New sequence name from Michael Somos, Oct 18 2014

A211971 Column 0 of square array A211970 (in which column 1 is A000041).

Original entry on oeis.org

1, 1, 2, 4, 6, 10, 16, 24, 36, 54, 78, 112, 160, 224, 312, 432, 590, 802, 1084, 1452, 1936, 2568, 3384, 4440, 5800, 7538, 9758, 12584, 16160, 20680, 26376, 33520, 42468, 53644, 67552, 84832, 106246, 132706, 165344, 205512, 254824, 315256, 389168, 479368
Offset: 0

Views

Author

Omar E. Pol, Jun 10 2012

Keywords

Comments

Partial sums give A015128. - Omar E. Pol, Jan 09 2014

Crossrefs

Programs

  • Mathematica
    Flatten[{1, Differences[Table[Sum[PartitionsP[n-k]*PartitionsQ[k], {k, 0, n}], {n, 0, 60}]]}] (* Vaclav Kotesovec, Oct 25 2016 *)
    CoefficientList[Series[(1 - x)/EllipticTheta[4, 0, x], {x, 0, 43}], x] (* Robert G. Wilson v, Mar 06 2018 *)

Formula

a(n) ~ exp(Pi*sqrt(n))*Pi / (16*n^(3/2)) * (1 - (3/Pi + Pi/4)/sqrt(n) + (3/2 + 3/Pi^2+ Pi^2/24)/n). - Vaclav Kotesovec, Oct 25 2016, extended Nov 04 2016
G.f.: (1 - x)/theta_4(x), where theta_4() is the Jacobi theta function. - Ilya Gutkovskiy, Mar 05 2018

A152198 Triangle read by rows, A007318 rows repeated.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 3, 3, 1, 1, 3, 3, 1, 1, 4, 6, 4, 1, 1, 4, 6, 4, 1, 1, 5, 10, 10, 5, 1, 1, 5, 10, 10, 5, 1, 1, 6, 15, 20, 15, 6, 1, 1, 6, 15, 20, 15, 6, 1, 1, 7, 21, 35, 35, 21, 7, 1, 1, 7, 21, 35, 35, 21, 7, 1, 1, 8, 28, 56, 70, 56, 28, 8, 1, 1, 8, 28, 56, 70, 56, 28, 8, 1
Offset: 0

Views

Author

Gary W. Adamson, Nov 28 2008

Keywords

Comments

Eigensequence of the triangle = A051163: (1, 2, 5, 12, 30, 76,...)
Another version of A152815. - Philippe Deléham, Dec 13 2008
Row sums : A016116(n); Diagonal sums: A000931(n+5). - Philippe Deléham, Dec 13 2008
Triangle, with zeros omitted, given by (1, 0, -1, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 1, -1, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938. - Philippe Deléham, Jan 16 2012
Sums along rising diagonals are A134816. - John Molokach, Jul 09 2013

Examples

			The triangle starts
1;
1;
1, 1;
1, 1;
1, 2, 1;
1, 2, 1;
1, 3, 3, 1;
1, 3, 3, 1;
1, 4, 6, 4, 1;
1, 4, 6, 4, 1;
1, 5, 10, 10, 5, 1;
1, 5, 10, 10, 5, 1;
...
Triangle (1,0,-1,0,0,...) DELTA (0,1,-1,0,0,...) begins:
1
1, 0
1, 1, 0
1, 1, 0, 0
1, 2, 1, 0, 0
1, 2, 1, 0, 0, 0
1, 3, 3, 1, 0, 0, 0
1, 3, 3, 1, 0, 0, 0, 0
1, 4, 6, 4, 1, 0, 0, 0, 0
1, 4, 6, 4, 1, 0, 0, 0, 0, 0
1, 5, 10, 10, 5, 1, 0, 0, 0, 0, 0...
		

Crossrefs

Programs

  • Mathematica
    t[n_, k_] := Binomial[ Floor[n/2], k]; Table[t[n, k], {n, 0, 17}, {k, 0, Floor[n/2]}] // Flatten (* Jean-François Alcover, Sep 13 2012 *)

Formula

Triangle read by rows, Pascal's triangle rows repeated.
Equals inverse binomial transform of A133156 unsigned.
G.f. : (1+x)/(1-(1+y)*x^2). - Philippe Deléham, Jan 16 2012
Sum_{k, 0<=k<=n} T(n,k)*x^k = A057077(n), A019590(n+1), A000012(n), A016116(n), A108411(n), A074872(n+1) for x = -2, -1, 0, 1, 2, 4 respectively. - Philippe Deléham, Jan 16 2012
T(n,k) = A065941(n-k, n-2*k) = abs(A108299(n-k, n-2*k)). - Johannes W. Meijer, Sep 05 2013

Extensions

More terms from Philippe Deléham, Dec 14 2008

A210843 Level of the n-th plateau of the column k of the square array A195825, when k -> infinity.

Original entry on oeis.org

1, 4, 13, 35, 86, 194, 415, 844, 1654, 3133, 5773, 10372, 18240, 31449, 53292, 88873, 146095, 236977, 379746, 601656, 943305, 1464501, 2252961, 3436182, 5198644, 7805248, 11634685, 17224795, 25336141, 37038139, 53828275, 77792869
Offset: 1

Views

Author

Omar E. Pol, Jun 19 2012

Keywords

Comments

Also the first (k+1)/2 terms of this sequence are the levels of the (k+1)/2 plateaus of the column k of A195825, whose lengths are k+1, k-1, k-3, k-5,... 2, if k is odd.
Also the first k/2 terms of this sequence are the levels of the k/2 plateaus of the column k of A195825, whose lengths are k+1, k-1, k-3, k-5,... 3, if k is a positive even number.
For the visualization of the plateaus see the graph of the sequences mentioned in crossrefs section (columns k=1..10 of A195825), for example see the graph of A210964.
Also numbers that are repeated in column k of square array A195825, when k -> infinity.
Note that the definition and the comments related to the square array A195825 mentioned above are also valid for the square array A211970, since both arrays contains the same columns, if k >= 1.
Is this the EULER transform of 4, 3, 3, 3, 3, 3, 3...?

Examples

			Column 1 of A195825 is A000041 which starts: [1, 1], 2, 3, 5, 7, 11... The column contains only one plateau: [1, 1] which has level 1 and length 2. So a(1) = 1.
Column 3 of A195825 is A036820 which starts: [1, 1, 1, 1], 2, 3, [4, 4], 5, 7, 10... The column contains only two plateaus: [1, 1, 1, 1], [4, 4], which have levels 1, 4 and lengths 4, 2. So a(1)= 1 and a(2) = 2.
Column 6 of A195825 is A195850 which starts: [1, 1, 1, 1, 1, 1, 1], 2, 3, [4, 4, 4, 4, 4], 5, 7, 10, 12, [13, 13, 13], 14, 16, 21... The column contains three plateaus: [1, 1, 1, 1, 1, 1, 1], [4, 4, 4, 4, 4], [13, 13, 13], which have levels 1, 4, 13 and lengths 7, 5, 3. So a(1) = 1, a(2) = 4 and a(3) = 13.
		

Crossrefs

Partial sums of A000716. Column 3 of A210764.

Programs

  • Mathematica
    CoefficientList[Series[1/(1-x)*Product[1/(1-x^k)^3,{k,1,50}],{x,0,50}],x] (* Vaclav Kotesovec, Aug 16 2015 *)

Formula

From Vaclav Kotesovec, Aug 16 2015: (Start)
a(n) ~ sqrt(2*n)/Pi * A000716(n).
a(n) ~ exp(sqrt(2*n)*Pi) / (8*Pi*n).
(End)

A188510 Expansion of x*(1 + x^2)/(1 + x^4) in powers of x.

Original entry on oeis.org

0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0
Offset: 0

Views

Author

Michael Somos, Apr 10 2011

Keywords

Examples

			G.f. = x + x^3 - x^5 - x^7 + x^9 + x^11 - x^13 - x^15 + x^17 + x^19 - x^21 + ...
		

Crossrefs

Programs

  • Magma
    m:=60; R:=PowerSeriesRing(Integers(), m); [0] cat Coefficients(R!(x*(1+x^2)/(1+x^4))); // G. C. Greubel, Aug 02 2018
  • Mathematica
    Table[KroneckerSymbol[-2, n], {n, 0, 104}] (* Wolfdieter Lang, May 30 2013 *)
    a[ n_] := Mod[n, 2] (-1)^Quotient[ n, 4]; (* Michael Somos, Apr 17 2015 *)
    CoefficientList[Series[x*(1+x^2)/(1+x^4), {x, 0, 60}], x] (* G. C. Greubel, Aug 02 2018 *)
    LinearRecurrence[{0,0,0,-1},{0,1,0,1},120] (* or *) PadRight[{},120,{0,1,0,1,0,-1,0,-1}] (* Harvey P. Dale, Jan 25 2023 *)
  • PARI
    {a(n) = (n%2) * (-1)^(n\4)};
    
  • PARI
    x='x+O('x^60); concat([0], Vec(x*(1+x^2)/(1+x^4))) \\ G. C. Greubel, Aug 02 2018
    

Formula

Euler transform of length 8 sequence [0, 1, 0, -2, 0, 0, 0, 1].
a(n) is multiplicative with a(2^e) = 0^e, a(p^e) = 1 if p == 1 or 3 (mod 8), a(p^e) = (-1)^e if p == 5 or 7 (mod 8).
G.f.: x * (1 - x^4)^2/((1 - x^2)*(1 - x^8)) = (x + x^3)/(1 + x^4).
a(-n) = -a(n) = a(n+4).
a(n+2) = A091337(n).
a(2*n) = 0, a(2*n+1) = A057077(n).
G.f.: x/(1 - x^2/(1 + 2*x^2/(1 - x^2))). - Michael Somos, Jan 03 2013
a(n) = ((-2)/n), where (k/n) is the Kronecker symbol. Period 8. See the Eric Weisstein link. - Wolfdieter Lang, May 29 2013
a(n) = A257170(n) unless n = 0.
From Jianing Song, Nov 14 2018: (Start)
a(n) = sqrt(2)*sin(Pi*n/2)*cos(Pi*n/4).
E.g.f.: sqrt(2)*sin(x/sqrt(2))*cosh(x/sqrt(2)).
Moebius transform of A002325.
a(n) = A091337(n)*A101455(n).
a(n) = ((-2)^(2*i+1)/n) for all integers i >= 0, where (k/n) is the Kronecker symbol. (End)
a(n) = A014017(n-1)+A014017(n-3). - R. J. Mathar, Dec 17 2024

A195849 Column 5 of array A195825. Also column 1 of triangle A195839. Also 1 together with the row sums of triangle A195839.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 3, 4, 4, 4, 4, 5, 7, 10, 12, 13, 13, 14, 16, 21, 27, 32, 34, 36, 38, 44, 54, 67, 77, 84, 88, 95, 107, 128, 152, 174, 188, 200, 215, 242, 281, 329, 370, 402, 428, 462, 513, 589, 674, 754, 816, 873, 940, 1041, 1176, 1333, 1477, 1600, 1710, 1845
Offset: 0

Views

Author

Omar E. Pol, Oct 07 2011

Keywords

Comments

Note that this sequence contains three plateaus: [1, 1, 1, 1, 1, 1], [4, 4, 4, 4], [13, 13]. For more information see A210843. See also other columns of A195825. - Omar E. Pol, Jun 29 2012
Number of partitions of n into parts congruent to 0, 1 or 6 (mod 7). - Ludovic Schwob, Aug 05 2021

Crossrefs

Programs

  • Maple
    A118277 := proc(n)
            7*n^2/8+7*n/8-3/16+3*(-1)^n*(1/16+n/8) ;
    end proc:
    A195839 := proc(n, k)
            option remember;
            local ks, a, j ;
            if A118277(k) > n then
                    0 ;
            elif n <= 5 then
                    return 1;
            elif k = 1 then
                    a := 0 ;
                    for j from 1 do
                            if A118277(j) <= n-1 then
                                    a := a+procname(n-1, j) ;
                            else
                                    break;
                            end if;
                    end do;
                    return a;
            else
                    ks := A118277(k) ;
                    (-1)^floor((k-1)/2)*procname(n-ks+1, 1) ;
            end if;
    end proc:
    A195849 := proc(n)
            A195839(n+1,1) ;
    end proc:
    seq(A195849(n), n=0..60) ; # R. J. Mathar, Oct 08 2011
  • Mathematica
    m = 61;
    Product[1/((1 - x^(7k))(1 - x^(7k - 1))(1 - x^(7k - 6))), {k, 1, m}] + O[x]^m // CoefficientList[#, x]& (* Jean-François Alcover, Apr 13 2020, after Ilya Gutkovskiy *)

Formula

G.f.: Product_{k>=1} 1/((1 - x^(7*k))*(1 - x^(7*k-1))*(1 - x^(7*k-6))). - Ilya Gutkovskiy, Aug 13 2017
a(n) ~ exp(Pi*sqrt(2*n/7)) / (8*sin(Pi/7)*n). - Vaclav Kotesovec, Aug 14 2017

A210964 Column 10 of square array A195825. Also column 1 of triangle A210954. Also 1 together with the row sums of triangle A210954.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 7, 10, 12, 13, 13, 13, 13, 13, 13, 13, 14, 16, 21, 27, 32, 34, 35, 35, 35, 35, 35, 36, 38, 44, 54, 67, 77, 83, 85, 86, 86, 86, 87, 89, 95, 107, 128, 152, 173, 185, 191, 193, 194, 195
Offset: 0

Views

Author

Omar E. Pol, Jun 16 2012

Keywords

Comments

Note that this sequence contains five plateaus: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [4, 4, 4, 4, 4, 4, 4, 4, 4], [13, 13, 13, 13, 13, 13, 13], [35, 35, 35, 35, 35], [86, 86, 86]. For more information see A210843 and other sequences of this family. - Omar E. Pol, Jun 29 2012

Crossrefs

Programs

  • Mathematica
    nmax = 100; CoefficientList[Series[Product[1 / ((1 - x^(12*k)) * (1 - x^(12*k-1)) * (1 - x^(12*k-11))), {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Nov 08 2015 *)

Formula

Expansion of 1 / f(-x, -x^11) in powers of x where f() is a Ramanujan theta function. - Michael Somos, Jan 10 2015
Partitions of n into parts of the form 12*k, 12*k+1, 12*k+11. - Michael Somos, Jan 10 2015
Euler transform of period 12 sequence [ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, ...]. - Michael Somos, Jan 10 2015
G.f.: Product_{k>0} 1 / ((1 - x^(12*k)) * (1 - x^(12*k - 1)) * (1 - x^(12*k - 11))).
Convolution inverse of A247133.
a(n) ~ sqrt(2)*(1+sqrt(3)) * exp(Pi*sqrt(n/6)) / (8*n). - Vaclav Kotesovec, Nov 08 2015
a(n) = (1/n)*Sum_{k=1..n} A284372(k)*a(n-k), a(0) = 1. - Seiichi Manyama, Mar 25 2017
a(n) = a(n-1) + a(n-11) - a(n-14) - a(n-34) + + - - (with the convention a(n) = 0 for negative n), where 1, 11, 14, 34, ... is the sequence of generalized 14-gonal numbers A195818. - Peter Bala, Dec 10 2020

A130151 Period 6: repeat [1, 1, 1, -1, -1, -1].

Original entry on oeis.org

1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1
Offset: 0

Views

Author

Paul Curtz, Aug 03 2007

Keywords

Examples

			G.f. = 1 + x + x^2 - x^3 - x^4 - x^5 + x^6 + x^7 + x^8 - x^9 - x^10 - x^11 + ...
G.f. = q + q^3 + q^5 - q^7 - q^9 - q^11 + q^13 + q^15 + q^17 - q^19 - q^21 + ...
		

Crossrefs

Programs

Formula

a(n+6) = a(n), a(0)=a(1)=a(2)=-a(3)=-a(4)=-a(5)=1.
a(n) = ((-1)^n * (4 * (cos((2*n + 1)*Pi/3) + cos(n*Pi)) + 1) - 4) / 3. - Federico Acha Neckar (f0383864(AT)hotmail.com), Sep 01 2007
a(n) = (-1)^n * (4 * cos((2*n + 1) * Pi/3) + 1) / 3. - Federico Acha Neckar (f0383864(AT)hotmail.com), Sep 02 2007
G.f.: (1+x+x^2)/((1+x)*(x^2-x+1)). - R. J. Mathar, Nov 14 2007
a(n) = 3*a(n-1) - a(n-3) + 3*a(n-4) for n>3. - Paul Curtz, Nov 22 2007
a(n) = (-1)^floor(n/3). Compare with A057077, A143621 and A143622. Define E(k) = Sum_{n >= 0} a(n)*n^k/n! for k = 0,1,2,... . Then E(k) is an integral linear combination of E(0), E(1) and E(2) (a Dobinski-type relation). Precisely, E(k) = A143628(k)*E(0) + A143629(k)*E(1) + A143630(k)*E(2). - Peter Bala, Aug 28 2008
Euler transform of length 6 sequence [1, 0, -2, 0, 0, 1]. - Michael Somos, Feb 26 2011
a(n) = b(2*n + 1) where b(n) is multiplicative with b(2^e) = 0^e, b(3^e) = -(-1)^e if e>0, b(p^e) = 1 if p == 1 (mod 4), b(p^e) = (-1)^e if p == 3 (mod 4) and p>3. - Michael Somos, Feb 26 2011
a(n + 3) = a(-1 - n) = -a(n) for all n in Z. - Michael Somos, Feb 26 2011
a(n) = (-1)^n * A257075(n) for all n in Z. - Michael Somos, Apr 15 2015
G.f.: 1 / (1 - x / (1 + 2*x^2 / (1 + x / (1 + x / (1 - x))))). - Michael Somos, Apr 15 2015
From Wesley Ivan Hurt, Jul 05 2016: (Start)
a(n) + a(n-3) = 0 for n>2.
a(n) = (cos(n*Pi) + 2*cos(n*Pi/3) + 2*sqrt(3)*sin(n*Pi/3)) / 3. (End)
a(n)*a(n-4) = a(n-1)*a(n-3) for all n in Z. - Michael Somos, Feb 25 2020

A130777 Coefficients of first difference of Chebyshev S polynomials.

Original entry on oeis.org

1, -1, 1, -1, -1, 1, 1, -2, -1, 1, 1, 2, -3, -1, 1, -1, 3, 3, -4, -1, 1, -1, -3, 6, 4, -5, -1, 1, 1, -4, -6, 10, 5, -6, -1, 1, 1, 4, -10, -10, 15, 6, -7, -1, 1, -1, 5, 10, -20, -15, 21, 7, -8, -1, 1, -1, -5, 15, 20, -35, -21, 28, 8, -9, -1, 1, 1, -6, -15, 35, 35, -56, -28, 36, 9, -10, -1, 1
Offset: 0

Views

Author

Philippe Deléham, Jul 14 2007

Keywords

Comments

Inverse of triangle in A061554.
Signed version of A046854.
From Paul Barry, May 21 2009: (Start)
Riordan array ((1-x)/(1+x^2),x/(1+x^2)).
This triangle is the coefficient triangle for the Hankel transforms of the family of generalized Catalan numbers that satisfy a(n;r)=r*a(n-1;r)+sum{k=1..n-2, a(k)*a(n-1-k;r)}, a(0;r)=a(1;r)=1. The Hankel transform of a(n;r) is h(n)=sum{k=0..n, T(n,k)*r^k} with g.f. (1-x)/(1-r*x+x^2). These sequences include A086246, A000108, A002212. (End)
From Wolfdieter Lang, Jun 11 2011: (Start)
The Riordan array ((1+x)/(1+x^2),x/(1+x^2)) with entries Phat(n,k)= ((-1)^(n-k))*T(n,k) and o.g.f. Phat(x,z)=(1+z)/(1-x*z+z^2) for the row polynomials Phat(n,x) is related to Chebyshev C and S polynomials as follows.
Phat(n,x) = (R(n+1,x)-R(n,x))/(x+2) = S(2*n,sqrt(2+x))
with R(n,x)=C_n(x) in the Abramowitz and Stegun notation, p. 778, 22.5.11. See A049310 for the S polynomials. Proof from the o.g.f.s.
Recurrence for the row polynomials Phat(n,x):
Phat(n,x) = x*Phat(n-1,x) - Phat(n-2,x) for n>=1; Phat(-1,x)=-1, Phat(0,x)=1.
The A-sequence for this Riordan array Phat (see the W. Lang link under A006232 for A- and Z-sequences for Riordan matrices) is given by 1, 0, -1, 0, -1, 0, -2, 0, -5,.., starting with 1 and interlacing the negated A000108 with zeros (o.g.f. 1/c(x^2) = 1-c(x^2)*x^2, with the o.g.f. c(x) of A000108).
The Z-sequence has o.g.f. sqrt((1-2*x)/(1+2*x)), and it is given by A063886(n)*(-1)^n.
The A-sequence of the Riordan array T(n,k) is identical with the one for the Riordan array Phat, and the Z-sequence is -A063886(n).
(End)
The row polynomials P(n,x) are the characteristic polynomials of the adjacency matrices of the graphs which look like P_n (n vertices (nodes), n-1 lines (edges)), but vertex no. 1 has a loop. - Wolfdieter Lang, Nov 17 2011
From Wolfdieter Lang, Dec 14 2013: (Start)
The zeros of P(n,x) are x(n,j) = -2*cos(2*Pi*j/(2*n+1)), j=1..n. From P(n,x) = (-1)^n*S(2*n,sqrt(2-x)) (see, e.g., the Lemma 6 of the W. Lang link).
The discriminants of the P-polynomials are given in A052750. (End)

Examples

			The triangle T(n,k) begins:
n\k  0   1   1   3    4    5    6    7    8    9  10  11  12  13 14 15 ...
0:   1
1:  -1   1
2:  -1  -1   1
3:   1  -2  -1   1
4:   1   2  -3  -1    1
5:  -1   3   3  -4   -1    1
6:  -1  -3   6   4   -5   -1    1
7:   1  -4  -6  10    5   -6   -1    1
8:   1   4 -10 -10   15    6   -7   -1    1
9:  -1   5  10 -20  -15   21    7   -8   -1    1
10: -1  -5  15  20  -35  -21   28    8   -9   -1   1
11:  1  -6 -15  35   35  -56  -28   36    9  -10  -1   1
12:  1   6 -21 -35   70   56  -84  -36   45   10 -11  -1   1
13: -1   7  21 -56  -70  126   84 -120  -45   55  11 -12  -1   1
14: -1  -7  28  56 -126 -126  210  120 -165  -55  66  12 -13  -1  1
15:  1  -8 -28  84  126 -252 -210  330  165 -220 -66  78  13 -14 -1  1
...  reformatted and extended - _Wolfdieter Lang_, Jul 31 2014.
---------------------------------------------------------------------------
From _Paul Barry_, May 21 2009: (Start)
Production matrix is
-1, 1,
-2, 0, 1,
-2, -1, 0, 1,
-4, 0, -1, 0, 1,
-6, -1, 0, -1, 0, 1,
-12, 0, -1, 0, -1, 0, 1,
-20, -2, 0, -1, 0, -1, 0, 1,
-40, 0, -2, 0, -1, 0, -1, 0, 1,
-70, -5, 0, -2, 0, -1, 0, -1, 0, 1 (End)
Row polynomials as first difference of S polynomials:
P(3,x) = S(3,x) - S(2,x) = (x^3 - 2*x) - (x^2 -1) = 1 - 2*x - x^2 +x^3.
Alternative triangle recurrence (see a comment above): T(6,2) = T(5,2) + T(5,1) = 3 + 3 = 6. T(6,3) = -T(5,3) + 0*T(5,1) = -(-4) = 4. - _Wolfdieter Lang_, Jul 31 2014
		

References

  • M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964. Tenth printing, Wiley, 2002 (also electronically available).

Crossrefs

Cf. A066170, A046854, A057077 (first column).
Row sums: A010892(n+1); repeat(1,0,-1,-1,0,1). Alternating row sums: A061347(n+2); repeat(1,-2,1).

Programs

  • Maple
    A130777 := proc(n,k): (-1)^binomial(n-k+1,2)*binomial(floor((n+k)/2),k) end: seq(seq(A130777(n,k), k=0..n), n=0..11); # Johannes W. Meijer, Aug 08 2011
  • Mathematica
    T[n_, k_] := (-1)^Binomial[n - k + 1, 2]*Binomial[Floor[(n + k)/2], k];
    Table[T[n, k], {n, 0, 11}, {k, 0, n}] // Flatten (* Jean-François Alcover, Nov 14 2017, from Maple *)
  • Sage
    @CachedFunction
    def A130777(n,k):
        if n< 0: return 0
        if n==0: return 1 if k == 0 else 0
        h = A130777(n-1,k) if n==1 else 0
        return A130777(n-1,k-1) - A130777(n-2,k) - h
    for n in (0..9): [A130777(n,k) for k in (0..n)] # Peter Luschny, Nov 20 2012

Formula

Number triangle T(n,k) = (-1)^C(n-k+1,2)*C(floor((n+k)/2),k). - Paul Barry, May 21 2009
From Wolfdieter Lang, Jun 11 2011: (Start)
Row polynomials: P(n,x) = sum(k=0..n, T(n,k)*x^k) = R(2*n+1,sqrt(2+x)) / sqrt(2+x), with Chebyshev polynomials R with coefficients given in A127672 (scaled T-polynomials).
R(n,x) is called C_n(x) in Abramowitz and Stegun's handbook, p. 778, 22.5.11.
P(n,x) = S(n,x)-S(n-1,x), n>=0, S(-1,x)=0, with the Chebyshev S-polynomials (see the coefficient triangle A049310).
O.g.f. for row polynomials: P(x,z):= sum(n>=0, P(n,x)*z^n ) = (1-z)/(1-x*z+z^2).
(from the o.g.f. for R(2*n+1,x), n>=0, computed from the o.g.f. for the R-polynomials (2-x*z)/(1-x*z+z^2) (see A127672))
Proof of the Chebyshev connection from the o.g.f. for Riordan array property of this triangle (see the P. Barry comment above).
For the A- and Z-sequences of this Riordan array see a comment above. (End)
abs(T(n,k)) = A046854(n,k) = abs(A066170(n,k)) T(n,n-k) = A108299(n,k); abs(T(n,n-k)) = A065941(n,k). - Johannes W. Meijer, Aug 08 2011
From Wolfdieter Lang, Jul 31 2014: (Start)
Similar to the triangles A157751, A244419 and A180070 one can give for the row polynomials P(n,x) besides the usual three term recurrence another one needing only one recurrence step. This uses also a negative argument, namely P(n,x) = (-1)^(n-1)*(-1 + x/2)*P(n-1,-x) + (x/2)*P(n-1,x), n >= 1, P(0,x) = 1. Proof by computing the o.g.f. and comparing with the known one. This entails the alternative triangle recurrence T(n,k) = (-1)^(n-k)*T(n-1,k) + (1/2)*(1 + (-1)^(n-k))*T(n-1,k-1), n >= m >= 1, T(n,k) = 0 if n < k and T(n,0) = (-1)^floor((n+1)/2) = A057077(n+1). [P(n,x) recurrence corrected Aug 03 2014]
(End)

Extensions

New name and Chebyshev comments by Wolfdieter Lang, Jun 11 2010

A195850 Column 6 of array A195825. Also column 1 of triangle A195840. Also 1 together with the row sums of triangle A195840.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 4, 4, 4, 4, 5, 7, 10, 12, 13, 13, 13, 14, 16, 21, 27, 32, 34, 35, 36, 38, 44, 54, 67, 77, 83, 86, 89, 95, 107, 128, 152, 173, 186, 194, 202, 216, 242, 281, 328, 368, 396, 415, 434, 464, 514, 588, 672, 748, 803, 844
Offset: 0

Views

Author

Omar E. Pol, Oct 07 2011

Keywords

Comments

Note that this sequence contains three plateaus: [1, 1, 1, 1, 1, 1, 1], [4, 4, 4, 4, 4], [13, 13, 13]. For more information see A210843 and other sequences of this family. - Omar E. Pol, Jun 29 2012
Number of partitions of n into parts congruent to 0, 1 or 7 (mod 8). - Peter Bala, Dec 10 2020

Crossrefs

Formula

G.f.: Product_{k>=1} 1/((1 - x^(8*k))*(1 - x^(8*k-1))*(1 - x^(8*k-7))). - Ilya Gutkovskiy, Aug 13 2017
a(n) ~ exp(Pi*sqrt(n)/2) / (4*sqrt(2-sqrt(2))*n). - Vaclav Kotesovec, Aug 14 2017
a(n) = a(n-1) + a(n-7) - a(n-10) - a(n-22) + + - - (with the convention a(n) = 0 for negative n), where 1, 7, 10, 22, ... is the sequence of generalized 10-gonal numbers A074377. - Peter Bala, Dec 10 2020
Previous Showing 21-30 of 93 results. Next