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

A052961 Expansion of (1 - 3*x) / (1 - 5*x + 3*x^2).

Original entry on oeis.org

1, 2, 7, 29, 124, 533, 2293, 9866, 42451, 182657, 785932, 3381689, 14550649, 62608178, 269388943, 1159120181, 4987434076, 21459809837, 92336746957, 397304305274, 1709511285499, 7355643511673, 31649683701868, 136181487974321, 585958388766001, 2521247479907042
Offset: 0

Views

Author

encyclopedia(AT)pommard.inria.fr, Jan 25 2000

Keywords

Comments

a(n) is the number of tilings of a 2 X n rectangle using integer dimension tiles at least one of whose dimensions is 1, so allowable dimensions are 1 X 1, 1 X 2, 1 X 3, 1 X 4, ..., and 2 X 1. - David Callan, Aug 27 2014
a(n+1) counts closed walks on K_2 containing one loop on the index vertex and four loops on the other vertex. Equivalently the (1,1)entry of A^(n+1) where the adjacency matrix of digraph is A=(1,1;1,4). - _David Neil McGrath, Nov 05 2014
A production matrix for the sequence is M =
1, 1, 0, 0, 0, 0, 0, ...
1, 0, 4, 0, 0, 0, 0, ...
1, 0, 0, 4, 0, 0, 0, ...
1, 0, 0, 0, 4, 0, 0, ...
1, 0, 0, 0, 0, 4, 0, ...
1, 0, 0, 0, 0, 0, 4, ...
...
Take powers of M and extract the upper left term, getting the sequence starting (1, 1, 2, 7, 29, 124, ...). - Gary W. Adamson, Jul 22 2016
From Gary W. Adamson, Jul 29 2016: (Start)
The sequence is N=1 in an infinite set obtained from matrix powers of [(1,N); (1,4)], extracting the upper left terms.
The infinite set begins:
N=1 (A052961): 1, 2, 7, 29 124, 533, 2293, ...
N=2 (A052984): 1, 3, 13, 59, 269, 1227, 5597, ...
N=3 (A004253): 1, 4, 19, 91, 436, 2089, 10009, ...
N=4 (A000351): 1, 5, 25, 125, 625, 3125, 15625, ...
N=5 (A015449): 1, 6, 31, 161, 836, 4341, 22541, ...
N=6 (A124610): 1, 7, 37, 199, 1069, 5743, 30853, ...
N=7 (A111363): 1, 8, 43, 239, 1324, 7337, 40653, ...
N=8 (A123270): 1, 9, 49, 281, 1601, 9129, 52049, ...
N=9 (A188168): 1, 10, 55, 325, 1900, 11125, 65125, ...
N=10 (A092164): 1, 11, 61, 371, 2221, 13331, 79981, ...
... (End)

Crossrefs

Programs

  • GAP
    a:=[1,2];; for n in [3..30] do a[n]:=5*a[n-1]-3*a[n-2]; od; a; # G. C. Greubel, Oct 23 2019
  • Magma
    I:=[1,2]; [n le 2 select I[n] else 5*Self(n-1)-3*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 17 2014
    
  • Maple
    spec:= [S,{S = Sequence(Union(Prod(Sequence(Union(Z,Z,Z)),Z),Z))}, unlabeled ]: seq(combstruct[count ](spec,size = n), n = 0..20);
    seq(coeff(series((1-3*x)/(1-5*x+3*x^2), x, n+1), x, n), n = 0..30); # G. C. Greubel, Oct 23 2019
  • Mathematica
    CoefficientList[Series[(1-3x)/(1-5x+3x^2),{x,0,30}],x] (* or *) LinearRecurrence[{5,-3},{1,2},30] (* Harvey P. Dale, Nov 23 2013 *)
  • PARI
    my(x='x+O('x^30)); Vec((1-3*x)/(1-5*x+3*x^2)) \\ G. C. Greubel, Oct 23 2019
    
  • Sage
    def A052961_list(prec):
        P. = PowerSeriesRing(ZZ, prec)
        return P((1-3*x)/(1-5*x+3*x^2)).list()
    A052961_list(30) # G. C. Greubel, Oct 23 2019
    

Formula

G.f.: (1-3*x)/(1-5*x+3*x^2).
a(n) = 5*a(n-1) - 3*a(n-2), with a(0) = 1, a(1) = 2.
a(n) = Sum_{alpha=RootOf(1-5*z+3*z^2)} (-1 + 9*alpha)*alpha^(-1-n)/13.
E.g.f.: (1 + sqrt(13) + (sqrt(13)-1) * exp(sqrt(13)*x)) / (2*sqrt(13) * exp(((sqrt(13)-5)*x)/2)). - Vaclav Kotesovec, Feb 16 2015
a(n) = A116415(n) - 3*A116415(n-1). - R. J. Mathar, Feb 27 2019

A189749 a(1)=5, a(2)=5, a(n)=5*a(n-1) + 5*a(n-2).

Original entry on oeis.org

5, 5, 50, 275, 1625, 9500, 55625, 325625, 1906250, 11159375, 65328125, 382437500, 2238828125, 13106328125, 76725781250, 449160546875, 2629431640625, 15392960937500, 90111962890625, 527524619140625, 3088182910156250, 18078537646484375, 105833602783203125
Offset: 1

Views

Author

Harvey P. Dale, Apr 26 2011

Keywords

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{5,5},{5,5},40]
  • Maxima
    a[1]:5$ a[2]:5$ a[n]:=5*a[n-1]+5*a[n-2]$ makelist(a[n], n, 1, 23); /* Bruno Berselli, May 24 2011 */

Formula

G.f.: 5*x*(1-4*x)/(1-5*x-5*x^2). - Bruno Berselli, May 24 2011
a(n) = 5*A188168(n). - R. J. Mathar, Feb 13 2020

A238160 A skewed version of triangular array A029653.

Original entry on oeis.org

1, 0, 2, 0, 1, 2, 0, 0, 3, 2, 0, 0, 1, 5, 2, 0, 0, 0, 4, 7, 2, 0, 0, 0, 1, 9, 9, 2, 0, 0, 0, 0, 5, 16, 11, 2, 0, 0, 0, 0, 1, 14, 25, 13, 2, 0, 0, 0, 0, 0, 6, 30, 36, 15, 2, 0, 0, 0, 0, 0, 1, 20, 55, 49, 17, 2, 0, 0, 0, 0, 0, 0, 7, 50, 91, 64, 19, 2, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Philippe Deléham, Feb 18 2014

Keywords

Comments

Triangle T(n,k), 0<=k<=n, read by rows, given by (0, 1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (2, -1, 0, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.
Row sums are Fib(n+2).
Column sums are A003945(k).
Diagonal sums are (-1)^(n+1)*A109266(n+1).
T(3*n,2*n) = A029651(n).

Examples

			Triangle begins:
1;
0, 2;
0, 1, 2;
0, 0, 3, 2;
0, 0, 1, 5, 2;
0, 0, 0, 4, 7, 2;
0, 0, 0, 1, 9, 9, 2;
0, 0, 0, 0, 5, 16, 11, 2;
0, 0, 0, 0, 1, 14, 25, 13, 2;
0, 0, 0, 0, 0, 6, 30, 36, 15, 2;
0, 0, 0, 0, 0, 1, 20, 55, 49, 17, 2;
0, 0, 0, 0, 0, 0, 7, 50, 91, 64, 19, 2;
...
		

Crossrefs

Formula

G.f.: (1+x*y)/(1-x*y-x^2*y).
T(n,k) = T(n-1,k-1) + T(n-2,k-1), T(0,0) = 1, T(1,0) = 0, T(1,1) = 2, T(n,k) = 0 if k<0 or if k>n.
Sum_{k=0..n} T(n,k)*x^k = A000007(n), A000045(n+2), A026150(n+1), A108306(n), A164545(n), A188168(n+1) for x = 0, 1, 2, 3, 4, 5 respectively.
Showing 1-3 of 3 results.