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 11-17 of 17 results.

A015551 Expansion of x/(1 - 6*x - 5*x^2).

Original entry on oeis.org

0, 1, 6, 41, 276, 1861, 12546, 84581, 570216, 3844201, 25916286, 174718721, 1177893756, 7940956141, 53535205626, 360916014461, 2433172114896, 16403612761681, 110587537144566, 745543286675801, 5026197405777636
Offset: 0

Views

Author

Olivier Gérard

Keywords

Comments

Let the generator matrix for the ternary Golay G_12 code be [I|B], where the elements of B are taken from the set {0,1,2}. Then a(n)=(B^n)1,2 for instance. - _Paul Barry, Feb 13 2004
Pisano period lengths: 1, 2, 4, 4, 1, 4, 42, 8, 12, 2, 10, 4, 12, 42, 4, 16, 96, 12, 360, 4, ... - R. J. Mathar, Aug 10 2012

Links

Crossrefs

Cf. A001076, A006190, A007482, A015520, A015521, A015523, A015524, A015525, A015528, A015529, A015530, A015531, A015532, A015533, A015534, A015535, A015536, A015537, A015440, A015441, A015443, A015444, A015445, A015447, A015548, A030195, A053404, A057087, A057088, A057089, A083858, A085939, A090017, A091914, A099012, A135030, A135032, A180222, A180226, A180250.

Programs

  • Magma
    I:=[0,1]; [n le 2 select I[n] else 6*Self(n-1)+5*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 14 2011
  • Mathematica
    Join[{a=0,b=1},Table[c=6*b+5*a;a=b;b=c,{n,100}]] (* Vladimir Joseph Stephan Orlovsky, Jan 16 2011 *)
CoefficientList[Series[x/(1-6x-5x^2),{x,0,20}],x] (* or *) LinearRecurrence[ {6,5},{0,1},30] (* Harvey P. Dale, Oct 30 2017 *)
  • PARI
    a(n)=([0,1; 5,6]^n*[0;1])[1,1] \\ Charles R Greathouse IV, Oct 03 2016
  • Sage
    [lucas_number1(n,6,-5) for n in range(0, 21)] # Zerinvary Lajos, Apr 24 2009

Formula

a(n) = 6*a(n-1) + 5*a(n-2).
a(n) = sqrt(14)*(3+sqrt(14))^n/28 - sqrt(14)*(3-sqrt(14))^n/28. - Paul Barry, Feb 13 2004

A015541 Expansion of x/(1 - 5*x - 7*x^2).

Original entry on oeis.org

0, 1, 5, 32, 195, 1199, 7360, 45193, 277485, 1703776, 10461275, 64232807, 394392960, 2421594449, 14868722965, 91294775968, 560554940595, 3441838134751, 21133075257920, 129758243232857, 796722742969725, 4891921417478624, 30036666288181195
Offset: 0

Views

Author

Olivier Gérard

Keywords

Comments

Pisano period lengths: 1, 3, 8, 6, 8, 24, 6, 6, 24, 24, 5, 24, 12, 6, 8, 12, 16, 24, 120, 24, ... - R. J. Mathar, Aug 10 2012

Links

Crossrefs

Cf. A001076, A006190, A007482, A015520, A015521, A015523, A015524, A015525, A015528, A015529, A015530, A015531, A015532, A015533, A015534, A015535, A015536, A015537, A015443, A015447, A030195, A053404, A057087, A057088, A083858, A085939, A090017, A091914, A099012, A180222, A180226.

Programs

Formula

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

A015544 Lucas sequence U(5,-8): a(n+1) = 5*a(n) + 8*a(n-1), a(0)=0, a(1)=1.

Original entry on oeis.org

0, 1, 5, 33, 205, 1289, 8085, 50737, 318365, 1997721, 12535525, 78659393, 493581165, 3097180969, 19434554165, 121950218577, 765227526205, 4801739379641, 30130517107845, 189066500576353, 1186376639744525, 7444415203333449, 46713089134623445
Offset: 0

Views

Author

Olivier Gérard

Keywords

Links

Crossrefs

Cf. A001076, A006190, A007482, A015520, A015521, A015523, A015524, A015525, A015528, A015529, A015530, A015531, A015532, A015533, A015534, A015535, A015536, A015537, A015441, A015443, A015447, A030195, A053404, A057087, A057088, A083858, A085939, A090017, A091914, A099012, A180222, A180226, A015555 (binomial transform).

Programs

  • Magma
    [n le 2 select n-1 else 5*Self(n-1) + 8*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 13 2012
  • Mathematica
    a[n_]:=(MatrixPower[{{1,2},{1,-6}},n].{{1},{1}})[[2,1]]; Table[Abs[a[n]],{n,-1,40}] (* Vladimir Joseph Stephan Orlovsky, Feb 19 2010 *)
LinearRecurrence[{5, 8}, {0, 1}, 30] (* Vincenzo Librandi, Nov 13 2012 *)
  • PARI
    A015544(n)=imag((2+quadgen(57))^n) \\ M. F. Hasler, Mar 06 2009
  • PARI
    x='x+O('x^30); concat([0], Vec(x/(1 - 5*x - 8*x^2))) \\ G. C. Greubel, Jan 01 2018
  • Sage
    [lucas_number1(n,5,-8) for n in range(0, 21)] # Zerinvary Lajos, Apr 24 2009

Formula

a(n) = 5*a(n-1) + 8*a(n-2).
G.f.: x/(1 - 5*x - 8*x^2). - M. F. Hasler, Mar 06 2009

Extensions

More precise definition by M. F. Hasler, Mar 06 2009

A099173 Array, A(k,n), read by diagonals: g.f. of k-th row x/(1-2*x-(k-1)*x^2).

Original entry on oeis.org

0, 0, 1, 0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 4, 4, 0, 1, 2, 5, 8, 5, 0, 1, 2, 6, 12, 16, 6, 0, 1, 2, 7, 16, 29, 32, 7, 0, 1, 2, 8, 20, 44, 70, 64, 8, 0, 1, 2, 9, 24, 61, 120, 169, 128, 9, 0, 1, 2, 10, 28, 80, 182, 328, 408, 256, 10, 0, 1, 2, 11, 32, 101, 256, 547, 896, 985, 512, 11
Offset: 0

Views

Author

Ralf Stephan, Oct 13 2004

Keywords

Examples

			Square array, A(n, k), begins as:
  0, 1, 2,  3,  4,   5,    6,    7,     8, ... A001477;
  0, 1, 2,  4,  8,  16,   32,   64,   128, ... A000079;
  0, 1, 2,  5, 12,  29,   70,  169,   408, ... A000129;
  0, 1, 2,  6, 16,  44,  120,  328,   896, ... A002605;
  0, 1, 2,  7, 20,  61,  182,  547,  1640, ... A015518;
  0, 1, 2,  8, 24,  80,  256,  832,  2688, ... A063727;
  0, 1, 2,  9, 28, 101,  342, 1189,  4088, ... A002532;
  0, 1, 2, 10, 32, 124,  440, 1624,  5888, ... A083099;
  0, 1, 2, 11, 36, 149,  550, 2143,  8136, ... A015519;
  0, 1, 2, 12, 40, 176,  672, 2752, 10880, ... A003683;
  0, 1, 2, 13, 44, 205,  806, 3457, 14168, ... A002534;
  0, 1, 2, 14, 48, 236,  952, 4264, 18048, ... A083102;
  0, 1, 2, 15, 52, 269, 1110, 5179, 22568, ... A015520;
  0, 1, 2, 16, 56, 304, 1280, 6208, 27776, ... A091914;
Antidiagonal triangle, T(n, k), begins as:
  0;
  0,  1;
  0,  1,  2;
  0,  1,  2,  3;
  0,  1,  2,  4,  4;
  0,  1,  2,  5,  8,  5;
  0,  1,  2,  6, 12, 16,   6;
  0,  1,  2,  7, 16, 29,  32,   7;
  0,  1,  2,  8, 20, 44,  70,  64,   8;
  0,  1,  2,  9, 24, 61, 120, 169, 128,   9;
  0,  1,  2, 10, 28, 80, 182, 328, 408, 256,  10;

Links

Crossrefs

Rows m: A001477 (m=0), A000079 (m=1), A000129 (m=2), A002605 (m=3), A015518 (m=4), A063727 (m=5), A002532 (m=6), A083099 (m=7), A015519 (m=8), A003683 (m=9), A002534 (m=10), A083102 (m=11), A015520 (m=12), A091914 (m=13).
Columns q: A000004 (q=0), A000012 (q=1), A009056 (q=2), A008586 (q=3).
Main diagonal gives A357502.

Programs

  • Magma
    A099173:= func< n,k | (&+[n^j*Binomial(k,2*j+1): j in [0..Floor(k/2)]]) >;
[A099173(n,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Feb 17 2023
  • Mathematica
    A[k_, n_]:= Which[k==0, n, n==0, 0, True, ((1+Sqrt[k])^n - (1-Sqrt[k])^n)/(2 Sqrt[k])]; Table[A[k-n, n]//Simplify, {k, 0, 12}, {n, 0, k}]//Flatten (* Jean-François Alcover, Jan 21 2019 *)
  • PARI
    A(k,n)=sum(i=0,n\2,k^i*binomial(n,2*i+1))
  • SageMath
    def A099173(n,k): return sum( n^j*binomial(k, 2*j+1) for j in range((k//2)+1) )
flatten([[A099173(n,k) for k in range(n+1)] for n in range(13)]) # G. C. Greubel, Feb 17 2023

Formula

A(n, k) = Sum_{i=0..floor(k/2)} n^i * C(k, 2*i+1) (array).
Recurrence: A(n, k) = 2*A(n, k-1) + (n-1)*A(n, k-2), with A(n, 0) = 0, A(n, 1) = 1.
T(n, k) = A(n-k, k) (antidiagonal triangle).
T(2*n, n) = A357502(n).
A(n, k) = ((1+sqrt(n))^k - (1-sqrt(n))^k)/(2*sqrt(n)). - Jean-François Alcover, Jan 21 2019

A127262 a(0)=2, a(1)=2, a(n) = 2*a(n-1) + 12*a(n-2).

Original entry on oeis.org

2, 2, 28, 80, 496, 1952, 9856, 43136, 204544, 926720, 4307968, 19736576, 91168768, 419176448, 1932378112, 8894873600, 40978284544, 188695052288, 869129519104, 4002599665664, 18434753560576, 84900703109120
Offset: 0

Views

Author

Miklos Kristof, Mar 27 2007

Keywords

Comments

If A091914(n-1)=F(n) the Fibonacci-like sequence, then a(n) is the Lucas-type sequence.

Links

Crossrefs

Cf. A091914, A125816.

Programs

  • Maple
    a[0]:=2:a[1]:=2:for i from 2 to 40 do a[i]:=2*a[i-1]+12*a[i-2] od: seq(a[n],n=0..40);
  • Mathematica
    LinearRecurrence[{2,12},{2,2},30] (* Harvey P. Dale, May 24 2017 *)
  • Sage
    [lucas_number2(n,2,-12) for n in range(0, 22)] # Zerinvary Lajos, Apr 30 2009

Formula

a(n) = ((1+sqrt(13))^n - (1-sqrt(13)^n))/(2*sqrt(13)).
G.f.: 2*(1-x)/(1-2*x-12*x^2).
E.g.f.: exp((1+sqrt(13))*x) + exp((1-sqrt(13))*x).
a(n) = A091914(n) + 12*A091914(n-2).
a(n) = 2*A125816(n). - Alois P. Heinz, Mar 03 2018

A122120 a(n) = 4*a(n-1) + 9*a(n-2), for n>1, with a(0)=1, a(1)=3.

Original entry on oeis.org

1, 3, 21, 111, 633, 3531, 19821, 111063, 622641, 3490131, 19564293, 109668351, 614752041, 3446023323, 19316861661, 108281656551, 606978381153, 3402448433571, 19072599164661, 106912432560783, 599303122725081
Offset: 0

Views

Author

Philippe Deléham, Oct 19 2006

Keywords

Links

Crossrefs

First differences of A015533.
Binomial transform of A091914.

Programs

  • Magma
    R:=PowerSeriesRing(Integers(), 30); Coefficients(R!( (1-x)/(1-4*x-9*x^2) )); // G. C. Greubel, Feb 26 2019
  • Mathematica
    CoefficientList[Series[(1-x)/(1-4*x-9*x^2), {x, 0, 30}], x] (* G. C. Greubel, Feb 26 2019 *)
nxt[{a_,b_}]:={b,4b+9a}; NestList[nxt,{1,3},20][[All,1]] (* or *) LinearRecurrence[{4,9},{1,3},30] (* Harvey P. Dale, Oct 06 2020 *)
  • PARI
    my(x='x+O('x^30)); Vec((1-x)/(1-4*x-9*x^2)) \\ G. C. Greubel, Feb 26 2019
  • Sage
    ((1-x)/(1-4*x-9*x^2)).series(x, 30).coefficients(x, sparse=False) # G. C. Greubel, Feb 26 2019

Formula

a(n) = Sum_{k=0..n} 3^(n-k)*A055380(n,k).
G.f.: (1-x)/(1-4*x-9*x^2).
Limit_{n -> oo} a(n+1)/a(n) = 2 + sqrt(13).

A292847 a(n) is the smallest odd prime of the form ((1 + sqrt(2*n))^k - (1 - sqrt(2*n))^k)/(2*sqrt(2*n)).

Original entry on oeis.org

5, 7, 101, 11, 13, 269, 17, 19, 509, 23, 709, 821, 29, 31, 46957, 55399, 37, 168846239, 41, 43, 9177868096974864412935432937651459122761, 47, 485329129, 2789, 53, 3229, 3461, 59, 61, 1563353111, 139237612541, 67, 5021, 71, 73, 484639, 6221, 79, 6869, 83, 7549
Offset: 1

Views

Author

XU Pingya, Sep 24 2017

Keywords

Examples

			For k = {1, 2, 3, 4, 5}, ((1 + sqrt(6))^k - (1 - sqrt(6))^k)/(2*sqrt(6)) = {1, 2, 9, 28, 101}. 101 is odd prime, so a(3) = 101.

Crossrefs

Cf. A000129, A002605, A015518, A063727, A002532, A083099, A015519, A003683, A002534, A083102, A015520, A091914, A079773, A161007, A099134.

Programs

  • Mathematica
    g[n_, k_] := ((1 + Sqrt[n])^k - (1 - Sqrt[n])^k)/(2Sqrt[n]);
Table[k = 3; While[! PrimeQ[Expand@g[2n, k]], k++]; Expand@g[2n, k], {n, 41}]
  • PARI
    g(n,k) = ([0,1;2*n-1,2]^k*[0;1])[1,1]
a(n) = for(k=3,oo,if(ispseudoprime(g(n,k)),return(g(n,k)))) \\ Jason Yuen, Apr 12 2025

Formula

When 2*n + 3 = p is prime, a(n) = p.
Previous Showing 11-17 of 17 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.