This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A080968 #5 Jan 11 2024 09:40:03 %S A080968 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, %T A080968 24,24,24,6,24,24,24,24,24,24,24,24,24,24,6,24,24,24,24,24,6,24,24,6, %U A080968 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 %N A080968 Orbit size of each branch-reduced tree encoded by A080981(n) under Donaghey's "Map M" Catalan automorphism. %C A080968 This is the size of the cycle containing A080980(n) in the permutations A057505/A057506. %C A080968 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? %F A080968 a(n) = A080967(A080980(n)) %Y A080968 Cf. A080969, A080972. %K A080968 nonn %O A080968 0,3 %A A080968 _Antti Karttunen_, Mar 02 2003