Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045755
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A045755 8-fold factorials: product[k=0..n-1] (8*k+1). +0
21
1, 1, 9, 153, 3825, 126225, 5175225, 253586025, 14454403425, 939536222625, 68586144251625, 5555477684381625, 494437513909964625, 47960438849266568625, 5035846079172989705625, 569050606946547836735625 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n+1) = (8*n+1)(!^8).

a(n) = Sum_{k=0..n} (-8)^(n-k)*A048994(n, k); A048994 = Stirling-1 numbers.

E.g.f. (1-8*x)^(-1/8).

MAPLE

f := n->product(8*k+1), k=0..(n-1));

restart: G(x):=(1-8*x)^(-1/8): 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..15); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 03 2009]

MATHEMATICA

s=1; lst={s}; Do[s+=n*s; AppendTo[lst, s], {n, 8, 5!, 8}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Nov 08 2008]

PROGRAM

(PARI) a(n)=if(n==0, 1, prod(k=0, n, 8*k+1))

CROSSREFS

Cf. k-fold factorials : A000142, A001147, A007559, A007696, A008548, A008542, A045754.

Cf. A051187, A113135.

Sequence in context: A133309 A151835 A113391 this_sequence A009037 A012148 A109677

Adjacent sequences: A045752 A045753 A045754 this_sequence A045756 A045757 A045758

KEYWORD

nonn

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de)

EXTENSIONS

Additional comments from Philippe DELEHAM (kolotoko(AT)wanadoo.fr) and Paul D. Hanna (pauldhanna(AT)juno.com), Oct 29 2005

Edited by N. J. A. Sloane (njas(AT)research.att.com), Oct 14 2008 at the suggestion of Artur Jasinski.

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research