Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A029850
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A029850 Number of self-converse groupoids. +0
4
1, 1, 4, 138, 60160, 453292525, 72471180989664, 298545867396801815077, 37263960166680610905649057368, 161614516495439236943507628117344255307, 27480138271604938271870114918720067827110789528890 (list; graph; listen)
OFFSET

0,3

LINKS

Index entries for sequences related to groupoids

FORMULA

a(n) = sum {1*s_1+2*s_2+...=n} (fix A[s_1, s_2, ...]/(1^s_1*s_1!*2^s_2*s2!*...)) where fix A[s_1, s_2, ...] = prod {i>=j>=1} f(i, j, s_i, s_j) where f(i, j, s_i, s_j) = {i=j, odd} (sum {d|i*2} (d*s_d))^((i*s_i^2-s_i)/2) * (sum {d|i} (d*s_d))^s_i or {i=j == 0 mod 4} (sum {d|i} (d*s_d))^(i*s_i^2) or {i=j == 2 mod 4} (sum {d|i})^(i*s_i^2-s_i) * (sum {d|i/2} (d*s_d))^(2*s_i) or {i != j} (sum {d|lcm(i, j, 2)} (d*s_d))^(2*gcd(i, j)*s_i*s_j/(s_i*s_j*lcm(2*i*j)))

CROSSREFS

a(n) = 2*A001424(n)-A001329(n). Cf. A001425.

Sequence in context: A001374 A155207 A089666 this_sequence A093981 A055304 A002917

Adjacent sequences: A029847 A029848 A029849 this_sequence A029851 A029852 A029853

KEYWORD

nonn

AUTHOR

Christian Bower (bowerc(AT)usa.net), Jan 15, 1998; Jun 15, 1998; Dec 05 2003

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research