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

A368851 Number of (undirected) paths in the n-Dorogovtsev-Goltsev-Mendes graph.

Original entry on oeis.org

1, 6, 108, 12630, 30263484, 27712501015350, 7560818318577145967460876, 469290709294376894968630603296687409248422837718
Offset: 0

Views

Author

Eric W. Weisstein, Jan 07 2024

Keywords

Comments

Using the convention that DGM(0) = P_2.

Crossrefs

Cf. A368190.

Programs

  • PARI
    step(S)={my([p,q,r,s,t]=S); [3*(p + q^2 + (2*q*r - r^2)*t + s*t^2), 2*(q + q*t + r*t^2), q + r + r*t, s + 4*q*r + r^2*(2*t - 1) + 2*s*t, t + t^2]}
    a(n,x=1)={my(S=[x, x, 0, 0, x]); for(i=1, n, S=step(S)); S[1]} \\ Andrew Howroyd, Jun 09 2025

Extensions

a(5) onwards from Andrew Howroyd, Jun 08 2025

A369821 Number of (undirected) Eulerian cycles in the n-Dorogovtsev-Goltsev-Mendes graph.

Original entry on oeis.org

0, 1, 16, 10146816, 24578010504157244424192000000
Offset: 0

Views

Author

Eric W. Weisstein, Feb 02 2024

Keywords

Comments

Using the convention that DGM(0) = P_2.
Term a(5) has 101 decimal digits and a(6) has 331 decimal digits. - Andrew Howroyd, Jun 09 2025

Crossrefs

Cf. A368190.

Extensions

a(4) onwards from Andrew Howroyd, Jun 09 2025
Showing 1-2 of 2 results.