|
| |
|
|
A052523
|
|
Number of unlabeled mobiles with cycles of length at least 3.
|
|
1
|
|
|
|
0, 1, 0, 1, 1, 2, 3, 6, 12, 25, 53, 114, 257, 567, 1294, 2944, 6790, 15693, 36598, 85578, 201299, 474975, 1125349, 2674160, 6374879, 15236478, 36510886, 87688909, 211061972, 509015536, 1229874162, 2976713669, 7216333477, 17520731199, 42599632645, 103714603196
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,6
|
|
|
LINKS
|
Robert Israel, Table of n, a(n) for n = 0..2234
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 91
|
|
|
MAPLE
|
spec := [S, {S=Union(B, Z), B=Cycle(S, 3 <= card)}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
|
CROSSREFS
|
Sequence in context: A032235 A192805 A162985 * A262430 A204855 A259098
Adjacent sequences: A052520 A052521 A052522 * A052524 A052525 A052526
|
|
|
KEYWORD
|
easy,nonn
|
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
EXTENSIONS
|
Terms a(21) and beyond from b-file by Andrew Howroyd, Feb 05 2018
|
|
|
STATUS
|
approved
|
| |
|
|
