login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A011795 [ C(n,4)/5 ]. 5
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; refs; listen; history; internal format)
OFFSET

0,7

COMMENTS

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

REFERENCES

J. M. Borwein, D. H. Bailey and R. Girgensohn, Experimentation in Mathematics, A K Peters, Ltd., Natick, MA, 2004. x+357 pp. See p. 147.

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

Index to sequences with linear recurrences with constant coefficients, signature (4,-6,4,-1,1,-4,6,-4,1).

FORMULA

G.f.: x^5(1+x^3)/((1-x)^3(1-x^2)(1-x^5))= x^5*(1-x+x^2)/((1-x)^5*(1+x+x^2+x^3+x^4)).

a(n)= floor(binomial(n+1,5)/(n+1)).[From Gary Detlefs, Nov 23 2011]

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 * A051170 A193911 A206417

Adjacent sequences:  A011792 A011793 A011794 * A011796 A011797 A011798

KEYWORD

nonn,easy

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.