login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034001 One third of triple factorial numbers. 10

%I

%S 1,6,54,648,9720,174960,3674160,88179840,2380855680,71425670400,

%T 2357047123200,84853696435200,3309294160972800,138990354760857600,

%U 6254565964238592000,300219166283452416000,15311177480456073216000

%N One third of triple factorial numbers.

%H INRIA Algorithms Project, <a href="http://algo.inria.fr/ecs/ecs?searchType=1&amp;service=Search&amp;searchTerms=495">Encyclopedia of Combinatorial Structures 495</a>

%H N. J. A. Sloane and Thomas Wieder, <a href="http://arXiv.org/abs/math.CO/0307064">The Number of Hierarchical Orderings</a>, Order 21 (2004), 83-89.

%F 3*a(n) = (3*n)!!! := product(3*j, j=1..n) = 3^n*n!; E.g.f. (-1+1/(1-3*x))/3.

%F E.g.f. : 1/(1-3x)^2 - _Paul Barry_, Sep 14 2004

%F a(n)-3*n*a(n-1)=0. - _R. J. Mathar_, Dec 02 2012

%p with(combstruct); SeqSeqSeqL := [T, {T=Sequence(S), S=Sequence(U,card >= 1), U=Sequence(Z,card >=1)},labeled]; seq(count(SeqSeqSeqL,size=j),j=1..12);

%p with(combstruct): SeqSeqSeqL := [T, {T=Sequence(S), S=Sequence(U, card >= 1), U=Sequence(Z, card >=1)}, labeled]: seq(count(SeqSeqSeqL, size=j), j=1..17); ;# [From _Zerinvary Lajos_, Apr 04 2009]

%p restart: G(x):=(1-3*x)^(n-3): f[0]:=G(x): for n from 1 to 29 do f[n]:=diff(f[n-1],x) od:x:=0:seq(f[n],n=0..16);# [From _Zerinvary Lajos_, Apr 04 2009]

%Y Cf. A007559, A034000.

%K easy,nonn

%O 1,2

%A _Wolfdieter Lang_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified April 19 17:29 EDT 2014. Contains 240767 sequences.