Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089402
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089402 Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A089864. +0
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; listen)
OFFSET

0,3

COMMENT

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

PROGRAM

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

CROSSREFS

Sequence in context: A049959 A006545 A121050 this_sequence A127940 A006796 A006076

Adjacent sequences: A089399 A089400 A089401 this_sequence A089403 A089404 A089405

KEYWORD

nonn,easy

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research