Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119555
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119555 Primes in the sequence a(n+1)=a(n)+[(-1)^n]*n!, with a(0)=0. +0
1
19, 619, 35899, 3301819, 46854407749206593671205204471893994868754333054697771997601741812995587666340613\ 11643770304505515758400998439571051364802378710174191580436354507567120887691335\ 44426722033165168878328322819566779381528981882285541609256481166622331374702000\ 809600061055686236758821446539362161635577019 (list; graph; listen)
OFFSET

0,1

COMMENT

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: A012845 A142023 A075879 this_sequence A107118 A162012 A078986

Adjacent sequences: A119552 A119553 A119554 this_sequence A119556 A119557 A119558

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), May 30 2006

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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research