Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085110
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085110 a(1) =1, then add 1 multiply by 2 to get a(2), subtract 1 and multiply by 3 to get a(3), add 1 and multiply by 4 to get a(4) and so on. +0
1
1, 4, 9, 40, 195, 1176, 8225, 65808, 592263, 5922640, 65149029, 846937390, 11857123446, 177856851705, 2845709627264, 48377063663505, 870787145943072, 16544955772918387, 330899115458367720, 6948881424625722141 (list; graph; listen)
OFFSET

1,2

FORMULA

a(1)=1, a(n)=n*a(n-1)+(-1)^n*n ; a(n)=round(n!*(2-exp(-1)))+(-1)^n - Benoit Cloitre (abmt(AT)orange.fr), Sep 24 2006

PROGRAM

(PARI) a(n)=if(n<2, 1, n*a(n-1)+(-1)^n*n) - Benoit Cloitre (abmt(AT)orange.fr), Sep 24 2006

CROSSREFS

Sequence in context: A149163 A149164 A073414 this_sequence A013459 A041229 A042887

Adjacent sequences: A085107 A085108 A085109 this_sequence A085111 A085112 A085113

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 04 2003

EXTENSIONS

More terms from Sam Alexander (amnalexander(AT)yahoo.com), Feb 26 2004

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research