Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134296
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134296 Quotients A134295(p)/p = Sum[ (p-k)!*(k-1)! - (-1)^k), {k,1,p} ]/p, where p = Prime[n]. +0
2
1, 2, 13, 259, 750371, 81566917, 2642791002353, 716984262871579, 102688143363690674087, 21841112114495269555043222069, 17727866746681961093761724283871 (list; graph; listen)
OFFSET

1,2

COMMENT

A134295(n) = Sum[ (n-k)!*(k-1)! - (-1)^k, {k, 1, n} ] = {2, 2, 6, 16, 65, 312, 1813, 12288, 95617, 840960, 8254081, ...}. According to the Generalized Wilson-Lagrange Theorem a prime p divides (p-k)!*(k-1)! - (-1)^k for all integer k>0. a(n) = A134295(p)/p for p = Prime[n]. a(n) is prime for n = {2, 3, 7, 9, 37, ...}. Corresponding prime terms in a(n) are {2, 13, 2642791002353, 102688143363690674087, ...}.

FORMULA

a(n) = Sum[ (Prime[n]-k)!*(k-1)! - (-1)^k, {k,1,Prime[n]} ] / Prime[n].

MATHEMATICA

Table[ (Sum[ (Prime[n]-k)!*(k-1)! - (-1)^k, {k, 1, Prime[n]} ]) / Prime[n], {n, 1, 20} ]

CROSSREFS

Cf. A007540, A007619 = Wilson quotients:((p-1)!+1)/p. Cf. A134295 = Sum[ (n-k)!*(k-1)! - (-1)^k, {k, 1, n} ].

Sequence in context: A135870 A133067 A042677 this_sequence A086510 A123113 A126742

Adjacent sequences: A134293 A134294 A134295 this_sequence A134297 A134298 A134299

KEYWORD

nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Oct 17 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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research