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

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063686 Triangular array: a(n,k) is the number of binary necklaces (no turning over) of length n whose longest run of 1's has length k. Table begins at n=1, k=0. 0
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 4, 4, 2, 1, 1, 1, 1, 4, 6, 4, 2, 1, 1, 1, 1, 7, 11, 8, 4, 2, 1, 1, 1, 1, 9, 19, 14, 8, 4, 2, 1, 1, 1, 1, 14, 33, 27, 16, 8, 4, 2, 1, 1, 1, 1, 18, 56, 50, 30, 16, 8, 4, 2, 1, 1, 1, 1, 30, 101, 96, 59, 32, 16, 8, 4, 2, 1, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,11

COMMENTS

Column k=1 appears to be A032190(n), n=2,3,...

LINKS

Table of n, a(n) for n=1..90.

EXAMPLE

Rows: {1,1}; {1,1,1}; {1,1,1,1}; {1,2,1,1,1}

CROSSREFS

Cf. A032190, A048004.

Sequence in context: A049704 A047996 A227690 * A008327 A133687 A215870

Adjacent sequences:  A063683 A063684 A063685 * A063687 A063688 A063689

KEYWORD

nonn,tabl

AUTHOR

Christopher Lenard (c.lenard(AT)bendigo.latrobe.edu.au), Aug 22 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 27 22:57 EDT 2017. Contains 287210 sequences.