login

The OEIS is supported by the many generous donors to the OEIS Foundation.  

 
Logo  

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)

Revision History for A005200

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A005200 Total number of fixed points in rooted trees with n nodes.
(history; published version)
#43byAlois P. Heinz at Fri Oct 27 19:39:46 EDT 2023
STATUS

editing

approved

#42byAlois P. Heinz at Fri Oct 27 19:39:43 EDT 2023
LINKS

T. D. Noe and Alois P. Heinz, <a href="/A005200/b005200.txt">Table of n, a(n) for n = 1..1000</a> (first 200 terms from T. D. Noe)

STATUS

approved

editing

#41byJon E. Schoenfield at Sun Dec 26 21:04:55 EST 2021
STATUS

editing

approved

#40byJon E. Schoenfield at Sun Dec 26 21:04:53 EST 2021
AUTHOR

_N. J. A. Sloane_._

STATUS

approved

editing

#39byBruno Berselli at Thu Jan 11 11:07:45 EST 2018
STATUS

proposed

approved

#38byMichel Marcus at Thu Jan 11 10:57:31 EST 2018
STATUS

editing

proposed

#37byMichel Marcus at Thu Jan 11 10:57:26 EST 2018
REFERENCES

F. Harary and E. M. Palmer, Probability that a point of a tree is fixed, Math. Proc. Camb. Phil. Soc. 85 (1979) 407-415.

LINKS

F. Harary and E. M. Palmer, <a href="http://dx.doi.org/10.1017/S0305004100055857">Probability that a point of a tree is fixed</a>, Math. Proc. Camb. Phil. Soc. 85 (1979) 407-415.

MATHEMATICA

terms+1];

STATUS

proposed

editing

#36byJean-François Alcover at Thu Jan 11 10:51:38 EST 2018
STATUS

editing

proposed

#35byJean-François Alcover at Thu Jan 11 10:51:11 EST 2018
MATHEMATICA

max = 30; sol[m_] := (c[0] = 0; f81[x_] := Sum[c[k]*x^k, {k, 0, m}]; cc = CoefficientList[Series[f81[x] - x*Exp[Sum[f81[x^k]/k, {k, 1, m}]], {x, 0, m}], x]; sc = First[Solve[Thread[cc == 0]]]; t[x_] := f81[x] /. sc; f[x_] := Sum[b[k]*x^k, {k, 0, m}]; b[0] = 0; bb = CoefficientList[Series[f[x] - t[x]*(1 + f[x] - f[x^2]), {x, 0, m}], x]; sb = First[Solve[Thread[bb == 0]]]; Apply[Set, sc, {1}]; Apply[Set, sb, {1}]); Do[sol[m], {m, 5, max, 5}]; Drop[CoefficientList[f[x] /. sb, x], 1] (* Jean-François Alcover, Sep 30 2011 *)

terms = 30; (* T = g.f. of A000081 *)

T[x_] = 0; Do[T[x_] = x*Exp[Sum[ T[x^k]/k, {k, 1, terms}]] + O[x]^(terms+1) // Normal, terms+1];

A[_] = 0; Do[A[x_] = T[x]*(1 + A[x] - A[x^2]) + O[x]^(terms+1) // Normal,

terms+1];

Drop[CoefficientList[A[x], x] , 1] (* Jean-François Alcover, Sep 30 2011, updated Jan 11 2018 *)

STATUS

approved

editing

Discussion
Thu Jan 11 10:51
Jean-François Alcover: Simplified 1st Mma program.
#34byAlois P. Heinz at Wed Nov 11 08:16:11 EST 2015
STATUS

editing

approved




Lookup |  Welcome |  Wiki |  Register |   Music |  Plot 2 |  Demos |  Index |  Browse |  More |  WebCam  
Contribute new seq. or comment |  Format |  Style Sheet |  Transforms |  Superseeker |  Recents  
The OEIS Community |  Maintained by The OEIS Foundation Inc.  


License Agreements, Terms of Use, Privacy Policy.  .  


Last modified July 17 02:40 EDT 2024. Contains 374360 sequences. (Running on oeis4.)