Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014288
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014288 [ Sum k!/2, k=0..n ], or floor( A003422(n+1)/2 ). +0
7
0, 1, 2, 5, 17, 77, 437, 2957, 23117, 204557, 2018957, 21977357, 261478157, 3374988557, 46964134157, 700801318157, 11162196262157, 189005910310157, 3390192763174157, 64212742967590157, 1280663747055910157 (list; graph; listen)
OFFSET

0,3

COMMENT

The first term a(0) would be a fraction if the floor( ... ) function would be omitted ; for n>=2, all terms from A003422 are even. - M. F. Hasler, Dec 16 2007

FORMULA

a(1)=1, a(2)=2, a(n)=(n+1)*a(n-1)-n*a(n-2). - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 07 2002

a(0) = 0, a(n) = (1/2)*Floor[1+1*Floor[1+2*Floor[1+....+(n-1)*Floor[1+n*Floor[1]]]....]. [From Joseph E. Cooper III (easonrevant(AT)gmail.com), Aug 19 2008]

MATHEMATICA

Contribution from Joseph E. Cooper III (easonrevant(AT)gmail.com), Aug 19 2008: (Start)

f[x_] := {Floor[1 + (n - x[[2]])*x[[1]]], x[[2]] + 1}

Nest[f, {1, 0}, n][[1]]/2 (End)

PROGRAM

(PARI) A014288(n)=sum(k=0, n, k!)>>1 \\ - M. F. Hasler, Dec 16 2007

CROSSREFS

Cf. A003422, A067078, A007489.

Sequence in context: A118100 A129591 A099825 this_sequence A020096 A054499 A001186

Adjacent sequences: A014285 A014286 A014287 this_sequence A014289 A014290 A014291

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Edited by M. F. Hasler (Maximilian.Hasler(AT)gmail.com), Dec 16 2007

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