Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080968
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080968 Orbit size of each branch-reduced tree encoded by A080981(n) under Donaghey's "Map M" Catalan automorphism. +0
4
1, 1, 2, 2, 3, 3, 3, 6, 6, 6, 6, 6, 6, 3, 2, 3, 5, 3, 5, 5, 5, 5, 3, 3, 2, 3, 6, 24, 24, 24, 24, 6, 24, 24, 24, 6, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 6, 24, 24, 24, 24, 24, 6, 24, 24, 6, 3, 18, 9, 24, 18, 18, 9, 18, 9, 18, 18, 3, 24, 15, 15, 24, 24, 18, 15, 15, 24, 3, 24, 24, 15, 15, 24 (list; graph; listen)
OFFSET

0,3

COMMENT

This is the size of the cycle containing A080980(n) in the permutations A057505/A057506.

If the conjecture given in A080070 is true, then this sequence contains only six 2's. Questions: are there any (other) values with finite number of occurrences? Which primes will eventually appear?

FORMULA

a(n) = A080967(A080980(n))

CROSSREFS

Cf. A080969, A080972.

Sequence in context: A029093 A078462 A157501 this_sequence A115733 A025496 A099959

Adjacent sequences: A080965 A080966 A080967 this_sequence A080969 A080970 A080971

KEYWORD

nonn

AUTHOR

Antti Karttunen (my_firstname.my_surname(AT)iki.fi) Mar 02 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research