Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113332
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113332 a(n) = A113129(2*n+2,n+2) for n>=0. +0
2
2, 10, 84, 930, 12452, 193284, 3393480, 66310914, 1425717060, 33435425100, 849342514200, 23235509430900, 681196753501992, 21309727555222600, 708630046700665104, 24964702239372310338, 928914855447585334020 (list; graph; listen)
OFFSET

0,1

COMMENT

Related to A000699, the number of irreducible diagrams with 2n nodes.

FORMULA

a(n) = A000699(n+1)*(2*n+3)*(n+2)/(3*(n+1)).

CROSSREFS

Cf. A113129, A000699.

Sequence in context: A121194 A121516 A024491 this_sequence A107863 A065866 A156466

Adjacent sequences: A113329 A113330 A113331 this_sequence A113333 A113334 A113335

KEYWORD

nonn

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr) and Paul D. Hanna (pauldhanna(AT)juno.com), Nov 03 2005

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research