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.

A027852 Number of connected functions on n points with a loop of length 2.

Original entry on oeis.org

0, 1, 1, 3, 6, 16, 37, 96, 239, 622, 1607, 4235, 11185, 29862, 80070, 216176, 586218, 1597578, 4370721, 12003882, 33077327, 91433267, 253454781, 704429853, 1962537755, 5479855546, 15332668869, 42983656210, 120716987723, 339596063606, 956840683968
Offset: 1

Views

Author

Christian G. Bower, Dec 14 1997

Keywords

Comments

Number of unordered pairs of rooted trees with a total of n nodes.
Equivalently, the number of rooted trees on n+1 nodes where the root has degree 2.
Number of trees on n nodes rooted at an edge. - Washington Bomfim, Jul 06 2012
Guy (1988) calls these tadpole graphs. - N. J. A. Sloane, Nov 04 2014
Number of unicyclic graphs of n nodes with a cycle length of two (in other words, a double edge). - Washington Bomfim, Dec 02 2020

Links

Crossrefs

Column 2 of A033185 (forests of rooted trees), A217781 (unicyclic graphs), A339303 (unoriented linear forests) and A339428 (connected functions).
Cf. A000081, A000106, A000226, A000631, A001372, A002861.

Programs

  • Maple
    with(numtheory): b:= proc(n) option remember; local d, j; `if`(n<=1, n, (add(add(d*b(d), d=divisors(j)) *b(n-j), j=1..n-1))/ (n-1)) end: a:= n-> (add(b(i) *b(n-i), i=0..n) +`if`(irem(n, 2)=0, b(n/2), 0))/2: seq(a(n), n=1..50);  # Alois P. Heinz, Aug 22 2008, revised Oct 07 2011
# second, re-usable version
A027852 := proc(N::integer)
    local dh, Nprime;
    dh := 0 ;
    for Nprime from 0 to N do
        dh := dh+A000081(Nprime)*A000081(N-Nprime) ;
    end do:
    if type(N,'even') then
        dh := dh+A000081(N/2) ;
    end if;
    dh/2 ;
end proc: # R. J. Mathar, Mar 06 2017
  • Mathematica
    Needs["Combinatorica`"];nn = 30; s[n_, k_] := s[n, k] = a[n + 1 - k] + If[n < 2 k, 0, s[n - k, k]]; a[1] = 1; a[n_] := a[n] = Sum[a[i] s[n - 1, i] i, {i, 1, n - 1}]/(n - 1); rt = Table[a[i], {i, 1, nn}]; Take[CoefficientList[CycleIndex[DihedralGroup[2], s] /. Table[s[j] -> Table[Sum[rt[[i]] x^(k*i), {i, 1, nn}], {k, 1, nn}][[j]], {j, 1, nn}], x], {2, nn}]  (* Geoffrey Critzer, Oct 12 2012, after code given by Robert A. Russell in A000081 *)
b[n_] := b[n] = If[n <= 1, n, (Sum[Sum[d b[d], {d, Divisors[j]}] b[n-j], {j, 1, n-1}])/(n-1)];
a[n_] := (Sum[b[i] b[n-i], {i, 0, n}] + If[Mod[n, 2] == 0, b[n/2], 0])/2;
Table[a[n], {n, 1, 50}] (* Jean-François Alcover, Oct 30 2018, after Alois P. Heinz *)
  • PARI
    seq(max_n)= { my(V = f = vector(max_n), i=1,s); f[1]=1;
for(j=1, max_n - 1, f[j+1] = 1/j * sum(k=1, j, sumdiv(k,d, d * f[d]) * f[j-k+1]));
for(n = 1, max_n, s = sum(k = 1, (n-1)/2, ( f[k] * f[n-k] ));
if(n % 2 == 1, V[i] = s, V[i] = s + (f[n/2]^2 + f[n/2])/2); i++); V };
\\ Washington Bomfim, Jul 06 2012 and Dec 01 2020

Formula

G.f.: A(x) = (B(x)^2 + B(x^2))/2 where B(x) is g.f. of A000081.
a(n) = Sum_{k=1..(n-1)/2}( f(k)*f(n-k) ) + [n mod 2 = 0] * ( f(n/2)^2+f(n/2) ) /2, where f(n) = A000081(n). - Washington Bomfim, Jul 06 2012 and Dec 01 2020
a(n) ~ c * d^n / n^(3/2), where d = A051491 = 2.9557652856519949747148..., c = A187770 = 0.43992401257102530404090339... . - Vaclav Kotesovec, Sep 12 2014
2*a(n) = A000106(n) + A000081(n/2), where A(.)=0 if the argument is non-integer. - R. J. Mathar, Jun 04 2020

Extensions

Edited by Christian G. Bower, Feb 12 2002

A303833 Birooted trees: number of unlabeled trees with n nodes rooted at 2 indistinguishable roots.

Original entry on oeis.org

0, 1, 2, 6, 15, 43, 116, 329, 918, 2609, 7391, 21099, 60248, 172683, 495509, 1424937, 4102693, 11830006, 34148859, 98686001, 285459772, 826473782, 2394774727, 6944343654, 20151175658, 58513084011, 170007600051, 494230862633
Offset: 1

Views

Author

R. J. Mathar, Brendan McKay, May 01 2018

Keywords

Links

Crossrefs

Subsets of graphs in A303831. Cf. A000243 (distinguishable roots), A000055 (not rooted).
Third column of A294783.
Cf. A000081, A000107, A027852, A303840, A304067, A339303.

Programs

  • Maple
    a000081 := [1, 1, 2, 4, 9, 20, 48, 115, 286, 719, 1842, 4766, 12486, 32973, 87811, 235381, 634847, 1721159, 4688676, 12826228, 35221832, 97055181, 268282855, 743724984, 2067174645, 5759636510, 16083734329, 45007066269, 126186554308, 354426847597] ;
g81 := add( op(i,a000081)*x^i,i=1..nops(a000081) ) ;
g := 0 ;
nmax := nops(a000081) ;
for m from 0 to nmax do
    mhalf := floor(m/2) ;
    ghalf := g81^(mhalf+1) ;
    gcyc := (ghalf^2+subs(x=x^2,ghalf))/2 ;
    if type(m,odd) then
        gcyc := gcyc*g81 ;
    end if;
    g := g+gcyc ;
end do:
taylor(g,x=0,nmax) ;
gfun[seriestolist](%) ; # R. J. Mathar, May 01 2018
  • PARI
    TreeGf is A000081 as g.f.
TreeGf(N) = {my(A=vector(N, j, 1)); for (n=1, N-1, A[n+1] = 1/n * sum(k=1, n, sumdiv(k, d, d*A[d]) * A[n-k+1] ) ); x*Ser(A)}
seq(n)={my(t=TreeGf(n), t2=subst(t,x,x^2)+O(x*x^n)); Vec((2*t^2-1)/(1-t) + (1+t)/(1-t2), -n)/2} \\ Andrew Howroyd, Dec 04 2020

Formula

G.f.: [g81(x)^2/{1-g81(x)} +(1+g81(x))*g81(x^2)/{1-g81(x^2)}] /2 = [ g243(x) +(1+g81(x))*g107(x^2)]/2, where g81 is the g.f. of A000081, g243 the g.f. of A000243 and g107 the g.f. of A000107. - R. J. Mathar, May 02 2018
a(n) = A027852(n) + A304067(n). - Brendan McKay, May 05 2018
a(n) = A303840(n+2) - A000081(n). - Andrew Howroyd, Dec 04 2020

A339302 Number of unlabeled rooted trees with n nodes rooted at two indistinguishable nodes at distance 3 from each other.

Original entry on oeis.org

1, 2, 8, 22, 69, 194, 564, 1584, 4484, 12550, 35204, 98412, 275422, 770416, 2157334, 6044684, 16956389, 47614380, 133865184, 376789710, 1061822884, 2995785714, 8461975888, 23928712708, 67739408492, 191964821890, 544559201634, 1546306248630, 4394984617389
Offset: 4

Views

Author

Andrew Howroyd, Dec 04 2020

Keywords

Comments

Number of unoriented linear forests with n nodes and 4 rooted trees.

Links

Crossrefs

Cf. A000081.
Column 4 of A339303.

Formula

G.f.: (r(x)^4 + r(x^2)^2)/2 where r(x) is the g.f. of A000081.
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.