|
|
A005654
|
|
Number of bracelets (turn over necklaces) with n red, 1 pink and n-1 blue beads; also reversible strings with n red and n-1 blue beads; also next-to-central column in Losanitsch's triangle A034851.
(Formerly M1640)
|
|
3
|
|
|
1, 2, 6, 19, 66, 236, 868, 3235, 12190, 46252, 176484, 676270, 2600612, 10030008, 38781096, 150273315, 583407990, 2268795980, 8836340260, 34461678394, 134564560988, 526024917288, 2058358034616, 8061901596814, 31602652961516, 123979635837176, 486734861612328
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (1/2) * (binomial(2*n-1, n) + binomial(n-1, floor(n/2))). - Michael Somos
Conjecture: n*(n-2)*a(n) - (5*n-3)*(n-2)*a(n-1) + 4*(n-2)*a(n-2) + 4*(5*n^2-27*n+37)*a(n-3) - 8*(2*n-7)*(n-4)*a(n-4) = 0. - R. J. Mathar, Nov 09 2013
|
|
MAPLE
|
|
|
MATHEMATICA
|
Table[(Binomial[2n-1, n]+Binomial[n-1, Floor[n/2]])/2, {n, 30}] (* Harvey P. Dale, May 17 2012 *)
|
|
PROG
|
(PARI) C(n, k)=binomial(n, k)
a(n)=(1/2)*(C(2*n-1, n)+C(n-1, n\2))
(Magma) [((Binomial(2*n-1, n)+Binomial(n-1, Floor(n/2)))/2): n in [1..30]]; // Vincenzo Librandi, May 24 2012
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|