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

A178381 Number of paths of length n starting at initial node of the path graph P_9.

Original entry on oeis.org

1, 1, 2, 3, 6, 10, 20, 35, 70, 125, 250, 450, 900, 1625, 3250, 5875, 11750, 21250, 42500, 76875, 153750, 278125, 556250, 1006250, 2012500, 3640625, 7281250, 13171875, 26343750, 47656250, 95312500, 172421875, 344843750
Offset: 0

Views

Author

Johannes W. Meijer, May 27 2010, May 29 2010

Keywords

Comments

Counts all paths of length n, n>=0, starting at initial node on the path graph P_9, see the Maple program.
The a(n) represent the number of possible chess games, ignoring the fifty-move and the triple repetition rules, after n moves by White in the following position: White Ka1, Nh1, pawns a2, b6, c2, d6, f2, g3 and g4; Black Ka8, Bc8, pawns a3, b7, c3, d7, f3 and g5.
The path graphs P_(2*p) have as limit(a(n+1)/a(n), n =infinity) = 2 resp. hypergeom([(p-1)/(2*p+1),(p+2)/(2*p+1)],[1/2],3/4) and the path graphs P_(2*p+1) have as limit(a(n+1)/a(n), n =infinity) = 1+cos(Pi/(p+1)), p>=1; see the crossrefs. - Johannes W. Meijer, Jul 01 2010

Examples

			G.f. = 1 + x + 2*x^2 + 3*x^3 + 6*x^4 + 10*x^5 + 20*x^6 + 35*x^7 + 70*x^8 + ...
		

Crossrefs

This is row 9 of A094718.
a(2*n) = A147748(n) and a(2*n+1) = A081567(n).
a(4*n+2) = A109106(n) and a(4*n+3) = A179135(n).
Cf. A000007 (P_1), A000012 (P_2), A016116 (P_3), A000045 (P_4), A038754 (P_5), A028495 (P_6), A030436 (P_7), A061551 (P_8), this sequence (P_9), A336675 (P_10), A336678 (P_11), and A001405 (P_infinity).
Cf. A216212 (P_9 starting in the middle).

Programs

  • Magma
    m:=50; R:=PowerSeriesRing(Integers(), m); Coefficients(R!((1+x-3*x^2-2*x^3+x^4)/(1-5*x^2+5*x^4))); // G. C. Greubel, Sep 18 2018
  • Maple
    with(GraphTheory): P:=9: G:=PathGraph(P): A:= AdjacencyMatrix(G): nmax:=36; for n from 0 to nmax do B(n):=A^n; a(n):=add(B(n)[1,k],k=1..P); od: seq(a(n),n=0..nmax);
    r := j -> (-1)^(j/10) - (-1)^(1-j/10):
    a := k -> add((2 + r(j))*r(j)^k, j in [1, 3, 5, 7, 9])/10:
    seq(simplify(a(n)), n=0..30); # Peter Luschny, Sep 18 2020
  • Mathematica
    CoefficientList[Series[(1+x-3*x^2-2*x^3+x^4)/(1-5*x^2+5*x^4), {x,0,50}], x] (* G. C. Greubel, Sep 18 2018 *)
  • PARI
    x='x+O('x^50); Vec((1+x-3*x^2-2*x^3+x^4)/(1-5*x^2+5*x^4)) \\ G. C. Greubel, Sep 18 2018
    

Formula

G.f.: (1+x-3*x^2-2*x^3+x^4)/(1-5*x^2+5*x^4).
a(n) = 5*a(n-2) - 5*a(n-4) for n>=5 with a(0)=1, a(1)=1, a(2)=2, a(3)=3 and a(4)=6.
G.f.: 1 / (1 - x / (1 - x / (1 + x / (1 + x / (1 - x / (1 - x / (1 + x / (1 + x)))))))). - Michael Somos, Feb 08 2015

A167808 Numerator of x(n), where x(n) = x(n-1) + x(n-2) with x(0)=0, x(1)=1/2.

Original entry on oeis.org

0, 1, 1, 1, 3, 5, 4, 13, 21, 17, 55, 89, 72, 233, 377, 305, 987, 1597, 1292, 4181, 6765, 5473, 17711, 28657, 23184, 75025, 121393, 98209, 317811, 514229, 416020, 1346269, 2178309, 1762289, 5702887, 9227465, 7465176, 24157817, 39088169, 31622993
Offset: 0

Views

Author

Reinhard Zumkeller, Nov 12 2009

Keywords

Comments

Define a sequence c(n) by c(0)=0, c(1)=1; thereafter c(n) = (c(n-2)*c(n-1)-1)/(c(n-2)+c(n-1)+2). Then it appears that (apart from signs), a(n) is the denominator of c(n). - Jonas Holmvall, Jun 21 2023

Crossrefs

Cf. A000045, A130196 (denominator).
The a(2*n) appear in A179135. - Johannes W. Meijer, Jul 01 2010

Programs

  • GAP
    a:=[0,1,1,1,3,5];; for n in [7..40] do a[n]:=4*a[n-3]+a[n-6]; od; a; # Muniru A Asiru, Oct 16 2018
  • Maple
    nmax:=39; x(0):=0: x(1):=1/2:for n from 2 to nmax do x(n):=x(n-1)+x(n-2) od: for n from 0 to nmax do a(n):= numer(x(n)) od: seq(a(n),n=0..nmax); # Johannes W. Meijer, Jul 01 2010
    with(combinat):f:=n->fibonacci(n):L:=n->f(n)+2*f(n-1):seq(numer(f(n)/L(n)), n=0..39); # Gary Detlefs, Dec 11 2010
  • Mathematica
    f[n_]:=Numerator[Fibonacci[n]/Fibonacci[n+3]];Array[f,100,0] (* Vladimir Joseph Stephan Orlovsky, Feb 17 2011*)
    Numerator[LinearRecurrence[{1,1},{0,1/2},40]] (* Harvey P. Dale, Aug 08 2014 *)
    CoefficientList[Series[-x (1 + x + x^2 - x^3 + x^4)/((x^2 + x - 1) (x^4 - x^3 + 2 x^2 + x + 1)), {x, 0, 40}], x] (* Vincenzo Librandi, Aug 08 2014 *)
    LinearRecurrence[{0, 0, 4, 0, 0, 1},{0, 1, 1, 1, 3, 5},40] (* Ray Chandler, Aug 03 2015 *)
    a[n_]:=If[Mod[n,3]==0, Fibonacci[n]/2, Fibonacci[n]]; Array[a, 40, 0] (* Stefano Spezia, Oct 16 2018 *)

Formula

a(n) = (a(n-1)*A131534(n) + a(n-2)*A131534(n+2))/A131534(n+1) for n > 1.
a(3*n) = A001076(n) = (a(3*n-1) + a(3*n-2))/2;
a(3*n+1) = A033887(n) = 2*a(3*n-1) + a(3*n-2);
a(3*n+2) = A015448(n+1) = a(3*n-1) + 2*a(3*n-2).
From Johannes W. Meijer, Jul 01 2010: (Start)
a(2*n) = A001906(n)/A131534(n+1) for n >= 0 and a(2*n+1) = A179131(n)/5 for n >= 1.
a(6*n+2) - 2*a(6*n) = A134493(n);
2*a(6*n+1) - a(6*n+3) = A023039(n);
2*a(6*n+4) - a(6*n+2) = A134497(n);
a(6*n+5) - 2*a(6*n+3) = A103134(n);
2*a(6*n+4) - a(6*n+6) = A075796(n).
(End)
From Gary Detlefs, Dec 11 2010: (Start)
a(n) = numerator(A000045(n)/A000032(n)).
If n mod 3 = 0 then a(n) = Fibonacci(n)/2, else a(n)= Fibonacci(n). (End)
G.f.: -x*(1 + x + x^2 - x^3 + x^4) / ( (x^2 + x - 1)*(x^4 - x^3 + 2*x^2 + x + 1) ). - R. J. Mathar, Mar 08 2011
a(n) = 4*a(n-3) + a(n-6). - Muniru A Asiru, Oct 16 2018

Extensions

Typo in title corrected by Johannes W. Meijer, Jun 26 2010

A179133 Denominators of A178381(4*n+3)/A178381(4*n+2).

Original entry on oeis.org

2, 4, 5, 26, 68, 89, 466, 1220, 1597, 8362, 21892, 28657, 150050, 392836, 514229, 2692538, 7049156, 9227465, 48315634, 126491972, 165580141, 866988874, 2269806340, 2971215073, 15557484098, 40730022148, 53316291173, 279167724890
Offset: 0

Views

Author

Johannes W. Meijer, Jul 01 2010

Keywords

Comments

For the numerators see A128052.

Crossrefs

Programs

  • Maple
    with(GraphTheory): nmax:=120; P:=9: G:=PathGraph(P): A:= AdjacencyMatrix(G): for n from 0 to nmax do B(n):=A^n; A178381(n):=add(B(n)[1,k],k=1..P); od: for n from 0 to nmax-1 do a(n):= denom(A178381(4*n+3)/A178381(4*n+2)) od: seq(a(n),n=0..nmax/4-1);
  • Mathematica
    Flatten[Table[{2*Fibonacci[6 n + 1], 2*Fibonacci[6 n + 3],
    Fibonacci[6 n + 5]}, {n, 0, 10}]] (* Greg Dresden, Oct 16 2021 *)
    LinearRecurrence[{0,0,18,0,0,-1},{2,4,5,26,68,89},30] (* Harvey P. Dale, Oct 08 2024 *)

Formula

a(n) = A179134(n)*A153727(n+1)/2.
Lim_{n->infinity} A128052(n+1)/A179133(n) = 1+cos(Pi/5) = A296182.
From Colin Barker, Jun 27 2013: (Start)
G.f.: -(x^5+4*x^4+10*x^3-5*x^2-4*x-2)/((x^2-3*x+1)*(x^4+3*x^3+8*x^2+3*x+1)).
a(n) = 18*a(n-3)-a(n-6). (End)
From Greg Dresden, Oct 16 2021: (Start)
a(3*n) = 2*Fibonacci(6*n+1),
a(3*n+1) = 2*Fibonacci(6*n+3),
a(3*n+2) = Fibonacci(6*n+5). (End)

A179132 Denominators of A178381(4*n+1)/A178381(4*n).

Original entry on oeis.org

1, 3, 14, 36, 47, 246, 644, 843, 4414, 11556, 15127, 79206, 207364, 271443, 1421294, 3720996, 4870847, 25504086, 66770564, 87403803, 457652254, 1198149156, 1568397607, 8212236486, 21499914244, 28143753123, 147362604494
Offset: 0

Views

Author

Johannes W. Meijer, Jul 01 2010

Keywords

Comments

For the numerators see A179131.

Crossrefs

Cf. A128052 and A179133.

Programs

  • Maple
    with(GraphTheory): nmax:=116; P:=9: G:=PathGraph(P): A:= AdjacencyMatrix(G): for n from 0 to nmax do B(n):=A^n; A178381(n):=add(B(n)[1,k],k=1..P); od: for n from 0 to nmax-1 do a(n):= denom(A178381(4*n+1)/A178381(4*n)) od: seq(a(n),n=0..nmax/4-1);
  • Mathematica
    LinearRecurrence[{0,0,18,0,0,-1},{1,3,14,36,47,246,644},30] (* Harvey P. Dale, Jun 11 2022 *)

Formula

a(n) = A069705(n-1)*A128052(n) for n>=1.
Limit(A179131(n)/A179132(n), n =infinity) = 1+cos(Pi/5) = A296182.
a(n) = 18*a(n-3)-a(n-6) for n>6. G.f.: -(3*x^6+6*x^5+7*x^4-18*x^3-14*x^2-3*x-1) / ((x^2-3*x+1)*(x^4+3*x^3+8*x^2+3*x+1)). - Colin Barker, Jun 27 2013
Showing 1-4 of 4 results.