Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089835
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089835 a(n) = (A000108(n)^2)*(n+1)!. +0
3
1, 2, 24, 600, 23520, 1270080, 87816960, 7420533120, 742053312000, 85781362867200, 11260753452748800, 1655330757554073600, 269436914075724595200, 48113734656379392000000 (list; graph; listen)
OFFSET

0,2

COMMENT

This sequence gives the total number of non-recursive "clauses" of n opening nodes, used in the construction of A089840.

PROGRAM

(MIT Scheme) (define (A089835 n) (* (A000108 n) (A000108 n) (A000142 (1+ n))))

CROSSREFS

a(n) = A001246(n)*A000142(n+1) = A001813(n)*A000108(n). INVERTi transform of A089836.

Sequence in context: A014298 A090316 A128578 this_sequence A009251 A009447 A123741

Adjacent sequences: A089832 A089833 A089834 this_sequence A089836 A089837 A089838

KEYWORD

nonn

AUTHOR

Antti Karttunen (His_Firstname.His_Surname(AT)iki.fi), 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research