Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072506
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072506 Triangle giving T(n,m) = number of necklaces of two colors with 2n beads of which m=1..n are black. +0
3
1, 1, 2, 1, 3, 4, 1, 4, 7, 10, 1, 5, 12, 22, 26, 1, 6, 19, 43, 66, 80, 1, 7, 26, 73, 143, 217, 246, 1, 8, 35, 116, 273, 504, 715, 810, 1, 9, 46, 172, 476, 1038, 1768, 2438, 2704, 1, 10, 57, 245, 776, 1944, 3876, 6310, 8398, 9252, 1, 11, 70, 335, 1197, 3399, 7752 (list; table; graph; listen)
OFFSET

1,3

COMMENT

Left half of even rows of triangle A047996 (with the leftmost edge discarded).

FORMULA

(1/(2n)) Sum_{d |(2n, m)} phi(d)*binomial(2n/d, m/d)

MATHEMATICA

Table[(Plus@@(EulerPhi[ # ]Binomial[2n/#, m/# ] &)/@Intersection[Divisors[2n], Divisors[m]])/(2n), {n, 13}, {m, n}]

CROSSREFS

Penultimate entries give binary necklaces of n-1 black beads and n+1 white beads, presumably A007595, antepenultimate entries give binary necklaces of n-2 black beads and n+2 white beads, presumably A003444.

Cf. A047996, A003444.

Sequence in context: A008949 A076832 A078925 this_sequence A133807 A093375 A103283

Adjacent sequences: A072503 A072504 A072505 this_sequence A072507 A072508 A072509

KEYWORD

nonn,tabl

AUTHOR

Wouter Meeussen (wouter.meeussen(AT)pandora.be), Aug 03 2002

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research