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.

A090018 a(n) = 6*a(n-1) + 3*a(n-2) for n > 2, a(0)=1, a(1)=6.

Original entry on oeis.org

1, 6, 39, 252, 1629, 10530, 68067, 439992, 2844153, 18384894, 118841823, 768205620, 4965759189, 32099171994, 207492309531, 1341251373168, 8669985167601, 56043665125110, 362271946253463, 2341762672896108, 15137391876137037, 97849639275510546, 632510011281474387
Offset: 0

Views

Author

Paul Barry, Nov 19 2003

Keywords

Comments

From Johannes W. Meijer, Aug 09 2010: (Start)
a(n) represents the number of n-move routes of a fairy chess piece starting in a given corner or side square on a 3 X 3 chessboard. This fairy chess piece behaves like a white queen on the eight side and corner squares but on the central square the queen explodes with fury and turns into a red queen, see A180032. The central square leads to A180028. (End)

Links

Crossrefs

Cf. A141041, A180028, A180032.
Sequences with g.f. of the form 1/(1 - 6*x - k*x^2): A106392 (k=-10), A027471 (k=-9), A006516 (k=-8), A081179 (k=-7), A030192 (k=-6), A003463 (k=-5), A084326 (k=-4), A138395 (k=-3), A154244 (k=-2), A001109 (k=-1), A000400 (k=0), A005668 (k=1), A135030 (k=2), this sequence (k=3), A135032 (k=4), A015551 (k=5), A057089 (k=6), A015552 (k=7), A189800 (k=8), A189801 (k=9), A190005 (k=10), A015553 (k=11).

Programs

  • Magma
    [n le 2 select 6^(n-1) else 6*Self(n-1)+3*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 15 2011
  • Maple
    a:= n-> (<<0|1>, <3|6>>^n. <<1,6>>)[1,1]:
seq(a(n), n=0..30);  # Alois P. Heinz, Jan 17 2011
  • Mathematica
    Join[{a=1,b=6},Table[c=6*b+3*a;a=b;b=c,{n,100}]] (* Vladimir Joseph Stephan Orlovsky, Jan 16 2011 *)
LinearRecurrence[{6,3}, {1,6}, 41] (* G. C. Greubel, Oct 10 2022 *)
  • PARI
    my(x='x+O('x^30)); Vec(1/(1-6*x-3*x^2)) \\ G. C. Greubel, Jan 24 2018
  • Sage
    [lucas_number1(n,6,-3) for n in range(1, 31)] # Zerinvary Lajos, Apr 24 2009

Formula

a(n) = (3+2*sqrt(3))^n*(sqrt(3)/4+1/2) + (1/2-sqrt(3)/4)*(3-2*sqrt(3))^n.
a(n) = (-i*sqrt(3))^n * ChebyshevU(n, isqrt(3)), i^2=-1.
From Johannes W. Meijer, Aug 09 2010: (Start)
G.f.: 1/(1 - 6*x - 3*x^2).
Limit_{k->oo} a(n+k)/a(k) = A141041(n) + A090018(n-1)*sqrt(12) for n >= 1.
Limit_{n->oo} A141041(n)/A090018(n-1) = sqrt(12). (End)
a(n) = Sum_{k=0..n} A099089(n,k)*3^k. - Philippe Deléham, Nov 21 2011
E.g.f.: exp(3*x)*(2*cosh(2*sqrt(3)*x) + sqrt(3)*sinh(2*sqrt(3)*x))/2. - Stefano Spezia, Apr 23 2025

Extensions

Typo in Mathematica program corrected by Vincenzo Librandi, Nov 15 2011

A171371 a(n) = 6*a(n-1) + 8*a(n-2) with a(1) = 8, a(2) = 18.

Original entry on oeis.org

8, 18, 172, 1176, 8432, 60000, 427456, 3044736, 21688064, 154486272, 1100422144, 7838423040, 55833915392, 397710876672, 2832936583168, 20179306512384, 143739331739648, 1023870442536960, 7293137309138944, 51949787395129344, 370043822843887616
Offset: 1

Views

Author

Anonymous, Dec 06 2009

Keywords

Comments

Seen on a quiz.
The recurrence was supplied by Zak Seidov, Dec 07 2009.

Links

Programs

  • Magma
    I:=[8,18]; [n le 2 select I[n] else 6*Self(n-1)+8*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 18 2011
  • Mathematica
    a[1] = 8; a[2] = 18; a[n_] := a[n] = 6*a[n - 1] + 8*a[n - 2]; Array[a, 20] (* Amiram Eldar, Nov 23 2018 *)

Formula

G.f.: 2*x*(-4 + 15*x)/(-1 + 6*x + 8*x^2). - V.J. Pohjola, Dec 07 2009
a(n) = 8*A189800(n) - 30*A189800(n-1). - R. J. Mathar, Nov 17 2011
From Franck Maminirina Ramaharo, Nov 23 2018: (Start)
a(n) = ((77*sqrt(17) - 255)*(sqrt(17) + 3)^n - (77*sqrt(17) + 255)*(3 - sqrt(17))^n)/136.
E.g.f.: ((77*sqrt(17)*sinh(sqrt(17)*x) - 255*cosh(sqrt(17)*x))*exp(3*x) + 255)/68. (End)

Extensions

More terms from N. J. A. Sloane, Dec 07 2009
G.f. and name adapted to the offset by Bruno Berselli, Apr 04 2011

A206800 Riordan array (1/(1-3*x+x^2), x*(1-x)/(1-3*x+x^2)).

Original entry on oeis.org

1, 3, 1, 8, 5, 1, 21, 19, 7, 1, 55, 65, 34, 9, 1, 144, 210, 141, 53, 11, 1, 377, 654, 534, 257, 76, 13, 1, 987, 1985, 1905, 1111, 421, 103, 15, 1, 2584, 5911, 6512, 4447, 2041, 641, 134, 17, 1, 6765, 17345, 21557, 16837, 9038, 3440, 925, 169, 19, 1
Offset: 0

Views

Author

Philippe Deléham, Feb 12 2012

Keywords

Examples

			Triangle begins :
1
3, 1
8, 5, 1
21, 19, 7, 1
55, 65, 34, 9, 1
144, 210, 141, 53, 11, 1
377, 654, 534, 257, 76, 13, 1
987, 1985, 1905, 1111, 421, 103, 15, 1
2584, 5911, 6512, 4447, 2041, 641, 134, 17, 1
6765, 17345, 21557, 16837, 9038, 3440, 925, 169, 19, 1
Triangle (0,3,-1/3,1/3,0,0,0,0,0,...) DELTA (1,0,-1/3,1/3,0,0,0,0,...) begins :
1
0, 1
0, 3, 1
0, 8, 5, 1
0, 21, 19, 7, 1
0, 55, 65, 34, 9, 1...

References

  • Subtriangle of the triangle given by (0, 3, -1/3, 1/3, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (1, 0, -1/3, 1/3, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.
  • Antidiagonal sums are A072264(n).

Crossrefs

Cf. A000045, A001519, A001906, A001870,

Formula

T(n,k) = 3*T(n-1,k) + T(n-1,k-1) - T(n-2,k) - T(n-2,k-1).
G.f.: 1/(1-(y+3)*x+(y+1)*x^2).
Sum_{k, 0<=k<=n} T(n,k)*x^k = (-1)^n* A015587(n+1), (-1)^n*A190953(n+1), (-1)^n*A015566(n+1), (-1)*A189800(n+1), (-1)^n*A015541(n+1), (-1)^n*A085939(n+1), (-1)^n*A015523(n+1), (-1)^n*A063727(n), (-1)^n*A006130(n), A077957(n), A000045(n+1), A000079(n), A001906(n+1), A007070(n), A116415(n), A084326(n+1), A190974(n+1), A190978(n+1), A190984(n+1), A190990(n+1), A190872(n) for x = -12, -11, -10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8 respectively.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.