Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039765
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039765 Number of edges in the Hasse diagrams for the D-analogues of the partition lattices. +0
3
0, 0, 4, 31, 240, 1931, 16396, 147589, 1408224, 14214559, 151394940, 1696783221, 19958826080, 245788962199, 3161635135340, 42390110260685, 591257152058944, 8563898444592927, 128598641049231996 (list; graph; listen)
OFFSET

0,3

LINKS

R. Suter, Two analogues of a classical sequence, J. Integer Sequences, Vol. 3 (2000), #P00.1.8.

FORMULA

E.g.f.: f_4(x) g_1(x) e_1(f_2(x)) + e_1(x) g_4(x) e_1(g_2(x))

e_n(x) = 1/n exp(n x); f_n(x) = 1/n (exp(n x) - 1); g_n(x) = 1/n (exp(n x) - 1 - n x)

CROSSREFS

Edges in the Hasse diagrams for partition lattices: A003128, B-analogues = A039759.

Adjacent sequences: A039762 A039763 A039764 this_sequence A039766 A039767 A039768

Sequence in context: A005216 A014537 A136284 this_sequence A001091 A077615 A025506

KEYWORD

nonn,nice

AUTHOR

Ruedi Suter (suter(AT)math.ethz.ch)

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 October 5 16:50 EDT 2008. Contains 144613 sequences.


AT&T Labs Research