Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A144773
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A144773 10-fold factorials : product [k=0..n-1](10k+1). +0
1
1, 1, 11, 231, 7161, 293601, 14973651, 913392711, 64850882481, 5252921480961, 478015854767451, 48279601331512551, 5359035747797893161, 648443325483545072481, 84946075638344404495011 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) =Sum_{k=0..n}(-10)^(n-k)*A048994(n,k)=Sum_{k=0..n}10^(n-k)*A132393(n,k). E.g.f. (1-10*x)^(-1/10). a(n) =A045757(n), n>0 .

MAPLE

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

CROSSREFS

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

Sequence in context: A068122 A015287 A045757 this_sequence A061115 A098321 A033864

Adjacent sequences: A144770 A144771 A144772 this_sequence A144774 A144775 A144776

KEYWORD

nonn

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 21 2008

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research