Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014144
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014144 Apply partial sum operator twice to factorials. +0
4
0, 1, 3, 7, 17, 51, 205, 1079, 6993, 53227, 462341, 4500255, 48454969, 571411283, 7321388397, 101249656711, 1502852293025, 23827244817339, 401839065437653, 7182224591785967, 135607710526966281 (list; graph; listen)
OFFSET

0,3

COMMENT

Equals row sums of triangle A137948 starting with offset 1. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Feb 28 2008

LINKS

Alexsandar Petojevic, The Function vM_m(s; a; z) and Some Well-Known Sequences, Journal of Integer Sequences, Vol. 5 (2002), Article 02.1.7

Index entries for sequences related to factorial numbers

FORMULA

a(n) = (n-1) * !n - n! + 1, !n = sum[ k=0..n-1 ] k! - Joe Keane (jgk(AT)jgk.org)

MATHEMATICA

lst={}; s0=s1=0; Do[s0+=a[n]; s1+=s0; AppendTo[lst, s1], {n, 0, 2*4!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 10 2008]

CROSSREFS

Cf. A000142, A003422.

Cf. A137948.

Sequence in context: A151265 A071985 A090977 this_sequence A096358 A146147 A153758

Adjacent sequences: A014141 A014142 A014143 this_sequence A014145 A014146 A014147

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research