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

A016140 Expansion of 1/((1-3*x)*(1-8*x)).

Original entry on oeis.org

1, 11, 97, 803, 6505, 52283, 418993, 3354131, 26839609, 214736555, 1717951489, 13743789059, 109950843913, 879608345627, 7036871547985, 56294986732787, 450359936909017, 3602879624412299, 28823037382718881, 230584300224012515, 1844674405278884521, 14757395252691429371, 118059162052912494577, 944473296517443135443
Offset: 0

Views

Author

Keywords

Comments

In general, for expansion of 1/((1-b*x)*(1-c*x)): a(n) = (c^(n+1) - b^(n+1))/(c-b) = (b+c)*a(n-1) - b*c*a(n-2) = b*a(n-1) + c^n = c*a(n-1) + b^n = Sum_{i=0..n} b^i*c^(n-i). - Henry Bottomley, Jul 20 2000
8*a(n) gives the number of edges in the n-th-order SierpiƄski carpet graph. - Eric W. Weisstein, Aug 19 2013

Crossrefs

Sequences with g.f. 1/((1-n*x)*(1-8*x)): A001018 (n=0), A023001 (n=1), A016131 (n=2), this sequence (n=3), A016152 (n=4), A016162 (n=5), A016170 (n=6), A016177 (n=7), A053539 (n=8), A016185 (n=9), A016186 (n=10), A016187 (n=11), A016188 (n=12), A060195 (n=16).
Cf. A190543.

Programs

Formula

a(n) = (8^(n+1) - 3^(n+1))/5.
a(n) = 11*a(n-1) - 24*a(n-2).
a(n) = 3*a(n-1) + 8^n.
a(n) = 8*a(n-1) + 3^n.
a(n) = Sum_{i=0..n} 3^i*8^(n-i).
E.g.f.: (1/5)*(8*exp(8*x) - 3*exp(3*x)). - G. C. Greubel, Nov 14 2024

A016161 Expansion of g.f. 1/((1-5*x)*(1-7*x)).

Original entry on oeis.org

1, 12, 109, 888, 6841, 51012, 372709, 2687088, 19200241, 136354812, 964249309, 6798573288, 47834153641, 336059778612, 2358521965909, 16540171339488, 115933787267041, 812299450322412, 5689910849522509
Offset: 0

Views

Author

Keywords

Comments

Also, this is the number of incongruent integer-edged Heron triangles whose circumdiameter is the product of n distinct primes each of shape 4k + 1. Cf. A003462, A109021. - R. K. Guy, Jan 31 2007

Crossrefs

Programs

  • Magma
    [n le 2 select 12^(n-1) else 12*Self(n-1) -35*Self(n-2): n in [1..30]]; // G. C. Greubel, Nov 09 2024
    
  • Mathematica
    CoefficientList[Series[1/((1-5x)(1-7x)),{x,0,30}],x] (* or *) LinearRecurrence[ {12,-35},{1,12},30] (* Harvey P. Dale, Nov 16 2021 *)
  • PARI
    Vec(1/((1-5*x)*(1-7*x))+O(x^99)) \\ Charles R Greathouse IV, Sep 24 2012
    
  • SageMath
    A016161=BinaryRecurrenceSequence(12,-35,1,12)
    [A016161(n) for n in range(31)] # G. C. Greubel, Nov 09 2024

Formula

From R. J. Mathar, Sep 18 2008: (Start)
a(n) = (7^(n+1) - 5^(n+1))/2 = A081200(n+1).
Binomial transform of A080962. (End)
a(n) = 7*a(n-1) + 5^n. - Vincenzo Librandi, Feb 09 2011
E.g.f.: exp(5*x)*(7*exp(2*x) - 5)/2. - Stefano Spezia, Oct 25 2023

A191468 a(n) = 8^n - 5^n.

Original entry on oeis.org

0, 3, 39, 387, 3471, 29643, 246519, 2019027, 16386591, 132264603, 1063976199, 8541106467, 68475336111, 548535110763, 4391942995479, 35153854510707, 281322388820031, 2251036874232123, 18010583812216359, 144096114589527747, 1152826137175206351, 9222895199696572683
Offset: 0

Views

Author

Vincenzo Librandi, Jun 03 2011

Keywords

Crossrefs

Programs

  • Magma
    [8^n - 5^n: n in [0..20]];
    
  • Mathematica
    Table[8^n-5^n,{n,0,20}] (* or *) LinearRecurrence[{13,-40},{0,3},30] (* Harvey P. Dale, Dec 04 2012 *)
    CoefficientList[Series[3 x/((1 - 5 x) (1 - 8 x)), {x, 0, 30}], x] (* Vincenzo Librandi, Oct 05 2014 *)
  • PARI
    a(n)=8^n-5^n \\ Charles R Greathouse IV, Jun 08 2011

Formula

a(n) = 13*a(n-1) - 40*a(n-2).
From Vincenzo Librandi, Oct 05 2014: (Start)
G.f.: 3*x/((1-5*x)*(1-8*x)).
a(n+1) = 3*A016162(n). (End)
E.g.f.: 2*exp(13*x/2)*sinh(3*x/2). - Elmo R. Oliveira, Mar 31 2025

A327317 Triangular array read by rows: row n shows the coefficients of this polynomial of degree n: p(x,n) = 2^(n-1) ((x+r)^n - (x+s)^n)/(r - s), where r = 2 and s = 1/2.

Original entry on oeis.org

1, 5, 4, 21, 30, 12, 85, 168, 120, 32, 341, 850, 840, 400, 80, 1365, 4092, 5100, 3360, 1200, 192, 5461, 19110, 28644, 23800, 11760, 3360, 448, 21845, 87376, 152880, 152768, 95200, 37632, 8960, 1024, 87381, 393210, 786384, 917280, 687456, 342720, 112896
Offset: 1

Views

Author

Clark Kimberling, Nov 03 2019

Keywords

Comments

p(x,n) is a strong divisibility sequence of polynomials. That is, gcd(p(x,h),p(x,k)) = p(x,gcd(h,k)). If x is an integer, then p(x,n) is a strong divisibility sequence of integers.

Examples

			First six rows:
     1;
     5,    4;
    21,   30,   12;
    85,  168,  120,   32;
   341,  850,  840,  400,   80;
  1365, 4092, 5100, 3360, 1200, 192;
The first six polynomials, not factored:
1, 5 + 4 x, 21 + 30 x + 12 x^2, 85 + 168 x + 120 x^2 + 32 x^3, 341 + 850 x + 840 x^2 + 400 x^3 + 80 x^4, 1365 + 4092 x + 5100 x^2 + 3360 x^3 + 1200 x^4 + 192 x^5.
The first six polynomials, factored:
1, 5 + 4 x, 3 (7 + 10 x + 4 x^2), (5 + 4 x) (17 + 20 x + 8 x^2), 341 + 850 x + 840 x^2 + 400 x^3 + 80 x^4, 3 (5 + 4 x) (7 + 10 x + 4 x^2) (13 + 10 x + 4 x^2).
		

Crossrefs

Cf. A327316, A002450 (x=0), A016137 (x=1), A001045 (x = -1), A016162 (x = 2), A016181 (x = 3), A016127 (x = -3), A016157 (x = 1/2).

Programs

  • Mathematica
    r = 2; s = 1/2; f[x_, n_] := 2^(n - 1) ((x + r)^n - (x + s)^n)/(r - s);
    Column[Table[Expand[f[x, n]], {n, 1, 5}]]
    c[x_, n_] := CoefficientList[Expand[f[x, n]], x]
    TableForm[Table[c[x, n], {n, 1, 10}]] (* A327317 array *)
    Flatten[Table[c[x, n], {n, 1, 12}]]   (* A327317 sequence *)

A025992 Expansion of 1/((1-2*x)*(1-5*x)*(1-7*x)*(1-8*x)).

Original entry on oeis.org

1, 22, 313, 3666, 38493, 377286, 3529681, 31947322, 282198565, 2447183310, 20920905369, 176852694018, 1481626607917, 12322682753494, 101879323774177, 838170485025354, 6867569457133749, 56077266261254238
Offset: 0

Views

Author

Keywords

Comments

From Bruno Berselli, May 09 2013: (Start)
a(n) - 2*a(n-1), for n>0, gives A019928 (after 1);
a(n) - 5*a(n-1), for n>0, gives A016311 (after 1);
a(n) - 7*a(n-1), for n>0, gives A016297 (after 1);
a(n) - 8*a(n-1), for n>0, gives A016296 (after 1);
a(n) - 7*a(n-1) + 10*a(n-2), for n>1, gives A016177 (after 15);
a(n) - 9*a(n-1) + 14*a(n-2), for n>1, gives A016162 (after 13);
a(n) - 10*a(n-1) + 16*a(n-2), for n>1, gives A016161 (after 12);
a(n) - 12*a(n-1) + 35*a(n-2), for n>1, gives A016131 (after 10);
a(n) - 13*a(n-1) + 40*a(n-2), for n>1, gives A016130 (after 9);
a(n) - 15*a(n-1) + 56*a(n-2), for n>1, gives A016127 (after 7);
a(n) - 20*a(n-1) +131*a(n-2) -280*a(n-3), for n>2, gives A000079 (after 4);
a(n) - 17*a(n-1) +86*a(n-2) -112*a(n-3), for n>2, gives A000351 (after 25);
a(n) - 15*a(n-1) +66*a(n-2) -80*a(n-3), for n>2, gives A000420 (after 49);
a(n) - 14*a(n-1) +59*a(n-2) -70*a(n-3), for n>2, gives A001018 (after 64),
and naturally: a(n) - 22*a(n-1) + 171*a(n-2) - 542*a(n-3) + 560*a(n-4), for n>3, gives 0 (see Harvey P. Dale in Formula lines). (End)

Crossrefs

Programs

  • Magma
    R:=PowerSeriesRing(Integers(), 30); Coefficients(R!(1/((1-2*x)*(1-5*x)*(1-7*x)*(1-8*x)))); // Bruno Berselli, May 09 2013
    
  • Mathematica
    CoefficientList[Series[1/((1-2x)(1-5x)(1-7x)(1-8x)),{x,0,30}],x] (* or *) LinearRecurrence[ {22,-171,542,-560},{1,22,313,3666},30] (* Harvey P. Dale, Jan 29 2013 *)
  • PARI
    a(n) = n+=3; (5*8^n-9*7^n+5*5^n-2^n)/90 \\ Charles R Greathouse IV, Oct 03 2016
    
  • Python
    def A025992(n): return (5*pow(8,n+3)-9*pow(7,n+3)+pow(5,n+4)-pow(2,n+3))//90
    print([A025992(n) for n in range(41)]) # G. C. Greubel, Dec 27 2024

Formula

a(0)=1, a(1)=22, a(2)=313, a(3)=3666, a(n) = 22*a(n-1) - 171*a(n-2) + 542*a(n-3) - 560*a(n-4). - Harvey P. Dale, Jan 29 2013
a(n) = (5*8^(n+3) - 9*7^(n+3) + 5^(n+4) - 2^(n+3))/90. - Yahia Kahloune, May 07 2013
E.g.f.: (1/90)*(-8*exp(2*x) + 625*exp(5*x) - 3087*exp(7*x) + 2560*exp(8*x)). - G. C. Greubel, Dec 27 2024

A102752 Array read by antidiagonals: T(n, k) = ((n+2)^k-(n-1)^k)/3.

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 0, 1, 3, 3, 0, 1, 5, 9, 5, 0, 1, 7, 21, 27, 11, 0, 1, 9, 39, 85, 81, 21, 0, 1, 11, 63, 203, 341, 243, 43, 0, 1, 13, 93, 405, 1031, 1365, 729, 85, 0, 1, 15, 129, 715, 2511, 5187, 5461, 2187, 171, 0, 1, 17, 171, 1157, 5261, 15309, 25999, 21845, 6561, 341, 0, 1
Offset: 0

Views

Author

Lambert Klasen (lambert.klasen(AT)gmx.net) and Gary W. Adamson, Feb 09 2005

Keywords

Comments

Consider a 3 X 3 matrix M =
[n, 1, 1]
[1, n, 1]
[1, 1, n].
The n-th row of the array contains the values of the nondiagonal elements of M^k, k=0,1,.... (Corresponding diagonal entry = nondiagonal entry + (n-1)^k.)
Table:
n: row sequence G.f. cross references.
0: (2^n-(-1)^n)/3 1/((1+1x)(1-2x)) A001045 (Jacobsthal sequence)
1: (3^n-0^n)/3 1/(1-3x) A000244
2: (4^n-1^n)/3 1/((1-1x)(1-4x)) A002450
3: (5^n-2^n)/3 1/((1-2x)(1-5x)) A016127
4: (6^n-3^n)/3 1/((1-3x)(1-6x)) A016137
5: (7^n-4^n)/3 1/((1-4x)(1-7x)) A016150
6: (8^n-5^n)/3 1/((1-5x)(1-8x)) A016162
7: (9^n-6^n)/3 1/((1-6x)(1-9x)) A016172
8: (10^n-7^n)/3 1/((1-7x)(1-10x)) A016181
9: (11^n-8^n)/3 1/((1-8x)(1-11x)) A016187
10:(12^n-9^n)/3 1/((1-9x)(1-12x)) A016191
If r(n) denotes a row sequence, r(n+1)/r(n) converges to n+2.
Columns follow polynomials with certain binomial coefficients:
column: polynomial
0: 0
1: 1
2: 2*n + 1
3: 3*n^2+ 3*n + 3
4: 4*n^3+ 6*n^2+ 12*n + 5
5: 5*n^4+10*n^3+ 30*n^2+ 25*n + 11
6: 6*n^5+15*n^4+ 60*n^3+ 75*n^2+ 66*n + 21
7: 7*n^6+21*n^5+105*n^4+ 175*n^3+ 231*n^2+ 147*n + 43
8: 8*n^7+28*n^6+168*n^5+ 350*n^4+ 616*n^3+ 588*n^2+344*n+ 85
etc.
Coefficients are generated by the array T(n,k)=(2^(n-k-1)-(-1)^(n-k-1))/3*(binomial(k+(n-k-1),n-k-1)) read by antidiagonals.

Examples

			Array begins:
  0, 1, 1,  3,   5,   11, ...
  0, 1, 3,  9,  27,   81, ...
  0, 1, 5, 21,  85,  341, ...
  0, 1, 7, 39, 203, 1031, ...
  0, 1, 9, 63, 405, 2511, ...
  ...
		

Programs

  • PARI
    MM(n,N)=local(M);M=matrix(n,n);for(i=1,n, for(j=1,n,if(i==j,M[i,j]=N,M[i,j]=1)));M for(k=0,10, for(i=0,10,print1((MM(3,k)^i)[1,2],","));print())
Showing 1-6 of 6 results.