Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A011795
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A011795 [ C(n,4)/5 ]. +0
6
0, 0, 0, 0, 0, 1, 3, 7, 14, 25, 42, 66, 99, 143, 200, 273, 364, 476, 612, 775, 969, 1197, 1463, 1771, 2125, 2530, 2990, 3510, 4095, 4750, 5481, 6293, 7192, 8184, 9275, 10472, 11781, 13209, 14763, 16450, 18278 (list; graph; listen)
OFFSET

0,7

COMMENT

a(n-1)=number of aperiodic necklaces (Lyndon words) with 5 black beads and n-5 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.: x^5(1+x^3)/((1-x)^3(1-x^2)(1-x^5)).

MAPLE

seq(floor(binomial(n, 4)/5), n=0.. 40); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 12 2009]

CROSSREFS

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

A column of triangle A011847.

Sequence in context: A004006 A089240 A057524 this_sequence A051170 A008646 A036830

Adjacent sequences: A011792 A011793 A011794 this_sequence A011796 A011797 A011798

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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research