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!)
A339647 Number of inequivalent leaf colorings of series-reduced planted trees with n leaves using exactly 2 colors. 2
0, 1, 3, 17, 73, 369, 1795, 9192, 47324, 249164, 1326449, 7155620, 38979373, 214304435, 1187338427, 6624057963, 37178881395, 209802434879, 1189621738769, 6774546637528, 38729276531965, 222191966031306, 1278819536137209, 7381798618249920, 42724974018583842 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Equivalence is up to permutation of the colors.
LINKS
EXAMPLE
a(2) = 1: (12).
a(3) = 3: (112), (1(12)), (1(22)).
a(4) = 17: (1112), (1122), (11(12)), (11(22)), (12(11)), (12(12)), (1(112)), (1(122)), (1(222)), (1(1(12))), (1(1(22))), (1(2(11))), (1(2(12))), (1(2(22))), ((11)(12)), ((11)(22)), ((12)(12)).
PROG
(PARI) \\ See A339647 for cycleIndexSeries and InequivalentColoringsSeq.
{ my(S=cycleIndexSeries(20)); InequivalentColoringsSeq(S, 2) - InequivalentColoringsSeq(S, 1) }
CROSSREFS
The case that colors may not be interchanged is A319377.
Column 2 of A339645.
Sequence in context: A282400 A342365 A179596 * A191587 A290411 A142868
KEYWORD
nonn
AUTHOR
Andrew Howroyd, Dec 16 2020
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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)