A190958
a(n) = 2*a(n-1) - 10*a(n-2), with a(0) = 0, a(1) = 1.
Original entry on oeis.org
0, 1, 2, -6, -32, -4, 312, 664, -1792, -10224, -2528, 97184, 219648, -532544, -3261568, -1197696, 30220288, 72417536, -157367808, -1038910976, -504143872, 9380822016, 23803082752, -46202054656, -330434936832, -198849327104, 2906650714112, 7801794699264
Offset: 0
Sequences of the form a(n) = c*a(n-1) - d*a(n-2), with a(0)=0, a(1)=1:
c/d...1.......2.......3.......4.......5.......6.......7.......8.......9......10
-
I:=[0,1]; [n le 2 select I[n] else 2*Self(n-1)-10*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Sep 17 2011
-
LinearRecurrence[{2,-10}, {0,1}, 50]
-
a(n)=([0,1; -10,2]^n*[0;1])[1,1] \\ Charles R Greathouse IV, Apr 08 2016
-
[lucas_number1(n,2,10) for n in (0..50)] # G. C. Greubel, Jun 10 2022
A207538
Triangle of coefficients of polynomials v(n,x) jointly generated with A207537; see Formula section.
Original entry on oeis.org
1, 2, 4, 1, 8, 4, 16, 12, 1, 32, 32, 6, 64, 80, 24, 1, 128, 192, 80, 8, 256, 448, 240, 40, 1, 512, 1024, 672, 160, 10, 1024, 2304, 1792, 560, 60, 1, 2048, 5120, 4608, 1792, 280, 12, 4096, 11264, 11520, 5376, 1120, 84, 1, 8192, 24576, 28160, 15360
Offset: 1
First seven rows:
1
2
4...1
8...4
16..12..1
32..32..6
64..80..24..1
(2, 0, 0, 0, 0, ...) DELTA (0, 1/2, -1/2, 0, 0, 0, ...) begins:
1
2, 0
4, 1, 0
8, 4, 0, 0
16, 12, 1, 0, 0
32, 32, 6, 0, 0, 0
64, 80, 24, 1, 0, 0, 0
128, 192, 80, 8, 0, 0, 0, 0
- Shara Lalo and Zagros Lalo, Polynomial Expansion Theorems and Number Triangles, Zana Publishing, 2018, ISBN: 978-1-9995914-0-3, pp. 80-83, 357-358.
-
u[1, x_] := 1; v[1, x_] := 1; z = 16;
u[n_, x_] := u[n - 1, x] + (x + 1)*v[n - 1, x]
v[n_, x_] := u[n - 1, x] + v[n - 1, x]
Table[Factor[u[n, x]], {n, 1, z}]
Table[Factor[v[n, x]], {n, 1, z}]
cu = Table[CoefficientList[u[n, x], x], {n, 1, z}];
TableForm[cu]
Flatten[%] (* A207537, |A028297| *)
Table[Expand[v[n, x]], {n, 1, z}]
cv = Table[CoefficientList[v[n, x], x], {n, 1, z}];
TableForm[cv]
Flatten[%] (* A207538, |A133156| *)
t[0, 0] = 1; t[n_, k_] := t[n, k] = If[n < 0 || k < 0, 0, 2 t[n - 1, k] + t[n - 2, k - 1]]; Table[t[n, k], {n, 0, 15}, {k, 0, Floor[n/2]}] // Flatten (* Zagros Lalo, Jul 31 2018 *)
t[n_, k_] := t[n, k] = 2^(n - 2 k) * (n - k)!/((n - 2 k)! k!) ; Table[t[n, k], {n, 0, 15}, {k, 0, Floor[n/2]} ] // Flatten (* Zagros Lalo, Jul 31 2018 *)
A090590
(1,1) entry of powers of the orthogonal design shown below.
Original entry on oeis.org
1, -6, -20, 8, 176, 288, -832, -3968, -1280, 29184, 68608, -96256, -741376, -712704, 4505600, 14712832, -6619136, -130940928, -208928768, 629669888, 2930769920, 824180736, -21797797888, -50189041664, 74004299776, 549520932864
Offset: 1
-
m:=27; R:=PowerSeriesRing(Integers(), m); Coefficients(R!(x*(1-8*x)/(1-2*x+8*x^2))); // Bruno Berselli, Jun 24-25 2011
-
a := proc(n) option remember: if(n=1)then return 1:elif(n=2)then return -6:fi: return 2*a(n-1)-8*a(n-2): end: seq(a(n),n=1..26); # Nathaniel Johnston, Jun 25 2011
-
LinearRecurrence[{2,-8},{1,-6},30] (* Harvey P. Dale, Mar 30 2019 *)
-
makelist(expand(((1+sqrt(-1)*sqrt(7))^n+(1-sqrt(-1)*sqrt(7))^n)/2),n,1,26); /* Bruno Berselli, Jun 24-25 2011 */
-
a=vector(26); a[1]=1; a[2]=-6; for(i=3, #a, a[i]=2*a[i-1]-8*a[i-2]); a \\ Bruno Berselli, Jun 24-25 2011
A201947
Triangle T(n,k), read by rows, given by (1,1,-1,0,0,0,0,0,0,0,...) DELTA (1,-1,1,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938.
Original entry on oeis.org
1, 1, 1, 2, 2, 0, 3, 5, 1, -1, 5, 10, 4, -2, -1, 8, 20, 12, -4, -4, 0, 13, 38, 31, -4, -13, -2, 1, 21, 71, 73, 3, -33, -11, 3, 1, 34, 130, 162, 34, -74, -42, 6, 6, 0, 55, 235, 344, 128, -146, -130, 0, 24, 3, -1
Offset: 0
Triangle begins:
1
1, 1
2, 2, 0
3, 5, 1, -1
5, 10, 4, -2, -1
8, 20, 12, -4, -4, 0
13, 38, 31, -4, -13, -2, 1
21, 71, 73, 3, -33, -11, 3, 1
34, 130, 162, 34, -74, -42, 6, 6, 0
55, 235, 344, 128, -146, -130, 0, 24, 3, -1
Showing 1-4 of 4 results.
Comments