Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000662
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000662 Relations with 3 arguments on n nodes.
(Formerly M2180 N0872)
+0
3
2, 136, 22377984, 768614354122719232, 354460798875983863749270670915141632, 146267071761884981524915186989628577728537526896649216991428608 (list; graph; listen)
OFFSET

1,1

REFERENCES

W. Oberschelp, Kombinatorische Anzahlbestimmungen in Relationen, Math. Ann., 174 (1967), 53-78.

F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, p. 76 (2.2.31)

LINKS

P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.

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*s_2!*...)) where fix A[s_1, s_2, ...] = 2^sum {i, j, k>=1} (i*j*k*s_i*s_j*s_k/lcm(i, j, k)).

CROSSREFS

Cf. A000595, A001377, A051241.

Adjacent sequences: A000659 A000660 A000661 this_sequence A000663 A000664 A000665

Sequence in context: A014315 A097641 A065963 this_sequence A087619 A051029 A084560

KEYWORD

nonn,nice

AUTHOR

njas

EXTENSIONS

Formula from Christian G. Bower (bowerc(AT)usa.net), Jan 06 2004

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research