Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A011797
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A011797 [ C(n,6)/7 ]. +0
6
0, 0, 0, 0, 0, 0, 0, 1, 4, 12, 30, 66, 132, 245, 429, 715, 1144, 1768, 2652, 3876, 5537, 7752, 10659, 14421, 19228, 25300, 32890, 42287, 53820, 67860, 84825, 105183, 129456, 158224, 192129, 231880, 278256 (list; graph; listen)
OFFSET

0,9

COMMENT

a(n-1)=number of aperiodic necklaces (Lyndon words) with 7 black beads and n-7 white beads.

LINKS

D. J. Broadhurst, On the enumeration of irreducible k-fold Euler sums and their roles in knot theory and field theory

Index entries for sequences related to Lyndon words

FORMULA

G.f.: (1+x^3)^2/((1-x)^4(1-x^2)^2(1-x^7)).

CROSSREFS

Cf. A000031, A001037, A051168. Same as A051172(n+1).

First differences of A011853.

A column of triangle A011847.

Sequence in context: A166213 A004036 A051172 this_sequence A032192 A118425 A097809

Adjacent sequences: A011794 A011795 A011796 this_sequence A011798 A011799 A011800

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), David Broadhurst (D.Broadhurst(AT)open.ac.uk)

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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research