login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119555 Primes in the sequence a(n+1)=a(n)+[(-1)^n]*n!, with a(0)=0. 0
19, 619, 35899, 3301819, 468544077492065936712052044718939948687543330546977719976017418129955876663406131164377030450551575840099843957105136480237871017419158043635450756712088769133544426722033165168878328322819566779381528981882285541609256481166622331374702000809600061055686236758821446539362161635577019 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

a(0)=0 a(1)=0 + [(-1)^1]*1! = 0 - 1 = -1 a(2)=-1 + [(-1)^2]*2! = -1 + 2 = 1 a(3)=1 + [(-1)^3]*3! = 1 - 6 = -5 a(4)=-5 + [(-1)^4]*4! = -5 + 24 = 19 that is prime

FORMULA

a(n+1)=a(n)+[(-1)^n]*n!, with a(0)=0

MAPLE

P:=proc(n) local i, j; j:=0; for i from 1 by 1 to n do j:=j+((-1)^i)*i!; if isprime(j) then print(j); fi; od; end: P(100);

CROSSREFS

Sequence in context: A075879 A180841 A183516 * A107118 A200849 A162012

Adjacent sequences:  A119552 A119553 A119554 * A119556 A119557 A119558

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (paoloplava(AT)gmail.com), May 30 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:21 EST 2012. Contains 205860 sequences.