login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080227 a(n) = n*a(n-1) + (1/2)*(1+(-1)^n), a(0)=0. 3
0, 0, 1, 3, 13, 65, 391, 2737, 21897, 197073, 1970731, 21678041, 260136493, 3381774409, 47344841727, 710172625905, 11362762014481, 193166954246177, 3477005176431187, 66063098352192553, 1321261967043851061, 27746501307920872281, 610423028774259190183 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
E.g.f.: (exp(x) + exp(-x) - 2)/(2*(1 - x)).
a(n) = floor((cosh(1)-1)*n!). - Benoit Cloitre, Feb 14 2003
a(n) = (n-1)*(a(n-1) + a(n-2)) + 1 for n > 1. - Gary Detlefs, Jun 22 2010
a(n) = (1/2)*(exp(-1)*Gamma(n+1,-1) + exp(1)*Gamma(n+1,1)) - Gamma(n+1,0). - Martin Clever, Mar 26 2023
MATHEMATICA
c=CoefficientList[Series[(e^x+e^(-x)-2)/(2(1-x)), {x, 0, 25}], x]; For[n = 0, n < 26, n++; Print[c[[n]]*(n - 1)! ]]
Join[{0}, RecurrenceTable[{a[1]==0, a[2]==1, a[n]==(n-1)(a[n-1]+a[n-2])+ 1}, a[n], {n, 30}]] (* Harvey P. Dale, Jul 21 2011 *)
CROSSREFS
Cf. A009179.
Sequence in context: A241598 A155867 A009102 * A199143 A002468 A198663
KEYWORD
easy,nonn
AUTHOR
Mario Catalani (mario.catalani(AT)unito.it), Feb 07 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 15 00:00 EDT 2024. Contains 374323 sequences. (Running on oeis4.)