Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141783
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141783 Number of bracelets with n beads: one blue, g green, and r = n-(g+1) red, for g = 12. +0
1
1, 7, 49, 231, 924, 3108, 9324, 25236, 63090, 147070, 323554, 676270, 1352540, 2600612, 4829708, 8692788, 15212379, 25949469, 43249115, 70562765, 112900424, 177412664, 274183208, 417232088, 625848132, 926250780, 1353751140 (list; graph; listen)
OFFSET

13,2

COMMENT

With offset g+1, the sequence a(n) of the numbers of bracelets with g green, and r = n-g-1 red beads is given by the formula of the paraffin numbers l(c,r) replacing c by g+3.

LINKS

Harold S. Grant, On a Formula for Circular Permutations.

FORMULA

a(n) = 1/2*(C(n-1,12) + C((n-2+n mod 2)/2, 6)).

EXAMPLE

The seven bracelets with 14 beads - 1 blue(B), 12 green(G), and 1 red(R) can be represented by the strings BGGGGGGGGGGGGR, BGGGGGGGGGGGRG, BGGGGGGGGGGRGG, BGGGGGGGGGRGGG, BGGGGGGGGRGGGG, BGGGGGGGRGGGGG, and BGGGGGGRGGGGGG.

PROGRAM

(PARI) g = 12 K = binomial(n-1, g)/2 a(n)= if(n%2*(g%2)==1, K, K+binomial((n-2+n%2)/2, (g-g%2)/2)/2)

CROSSREFS

Cf. A005993, A005994, A005995, A018210, A018211, A018212, A018213, A018214, A002620, A062136.

Sequence in context: A003530 A015953 A133047 this_sequence A094430 A146884 A113235

Adjacent sequences: A141780 A141781 A141782 this_sequence A141784 A141785 A141786

KEYWORD

easy,nonn

AUTHOR

Washington Bomfim (webonfim(AT)bol.com.br), Aug 17 2008

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 December 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research