login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089402 Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A089864. 3
1, 1, 2, 3, 8, 22, 68, 217, 720, 2438, 8412, 29414, 104048, 371516, 1337352, 4847637, 17679264, 64823110, 238820780, 883634026, 3282065072, 12233141908, 45741298616, 171529836218, 644952132448, 2430973304732, 9183676744088 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

The number of orbits to which the corresponding automorphism(s) partitions the set of A000108(n) binary trees with n internal nodes.

LINKS

A. Karttunen, C-program for computing the initial terms of this sequence

FORMULA

a(n) = (A000108(n)+A089408(n))/2

PROG

(Scheme) (define (A089402 n) (* (/ 1 2) (+ (A000108 n) (A089408 n))))

CROSSREFS

Sequence in context: A049959 A006545 A121050 * A127940 A006796 A006076

Adjacent sequences:  A089399 A089400 A089401 * A089403 A089404 A089405

KEYWORD

nonn,easy

AUTHOR

Antti Karttunen (His_Firstname.His_Surname(AT)iki.fi), Nov 29 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 14:07 EST 2012. Contains 205623 sequences.