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!)
A120420 Number of graphs of functions with n triple points. 2
1, 2, 19, 428, 17746, 1178792, 114892114, 15465685088, 2750970320776, 625218940868432, 176816078759177584, 60910324282361987648, 25113805147553980835056, 12212353714587611449244672 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Vladeta Jovovic, Feb 22 2008, Table of n, a(n) for n = 1..21
V. I. Arnold, Smooth function statistics, Funct. Anal. Other. Math., 1 (2006), 111-118.
Teena Carroll, David Galvin, The game of plates and olives, arXiv:1711.10670 [math.CO], 2017.
Liviu I. Nicolaescu, Counting Morse functions on the 2-sphere, arXiv:math/0512496 [math.GT], 2005-2006.
FORMULA
Nicolaescu gives a g.f.
a(n) >= A135487(n).
MATHEMATICA
Morse[a_, b_] := Module[{i, j, k, m, x, y, A}, A[0, 0]=1; m = a+b; For[k=1, k <= m, k++, For[y=0, y <= b, y++, x = k-y; If[y==0, A[x, y] = 1/(2^x), If[x>0, A[x, y] = (1/(x+2y+1))((x+1)A[x+1, y-1] + 1/2 (x+1)A[x-1, y] + 1/2 (x+1)Sum[Sum[A[i, j]A[x-i, y-1-j], {j, 0, y-1}], {i, 0, x}]), A[x, y] = (1/(2y+1))((x+1)A[x+1, y-1] + 1/2 (x+1)Sum[Sum[A[i, j]A[x-i, y-1-j], {j, 0, y-1}], {i, 0, x}])]]]]; a! (2b+1)! A[a, b]];
Table[Morse[0, n], {n, 0, 13}] (* Jean-François Alcover, Oct 05 2018, after Nicolaescu's code *)
CROSSREFS
Sequence in context: A155927 A353290 A332967 * A350939 A239674 A306457
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Feb 21 2008
EXTENSIONS
More terms from Vladeta Jovovic, Feb 22 2008
STATUS
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 April 24 10:00 EDT 2024. Contains 371935 sequences. (Running on oeis4.)