Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102647
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102647 a(n) = product of the remainders when the n-th prime is divided by primes up to the (n-1)-st prime. +0
6
0, 1, 2, 2, 8, 36, 288, 1920, 2880, 120960, 362880, 6386688, 34836480, 217728000, 3881779200, 275904921600, 1785411403776, 28217548800000, 608662978560000, 3492203839488000, 964122158039040000, 2224367550332928000 (list; graph; listen)
OFFSET

1,3

EXAMPLE

Prime(6) = 13, 13 mod 2 = 1, 13 mod 3 = 1, 13 mod 5 = 3, 13 mod 7 = 6, 13 mod 11 = 2 so a(6) = 1*1*3*6*2 = 36.

MATHEMATICA

f[n_] := Times @@ Mod[ Prime[n], Table[ Prime[i], {i, n - 1}]]; Table[ f[n], {n, 22}] (from Robert G. Wilson v Feb 04 2005)

CROSSREFS

Cf. A033955, A062347.

Sequence in context: A057132 A121197 A009543 this_sequence A060224 A111605 A009544

Adjacent sequences: A102644 A102645 A102646 this_sequence A102648 A102649 A102650

KEYWORD

nonn

AUTHOR

Hans Boelens (h.p.m.boelens(AT)pl.hanze.nl), Feb 02 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 04 2005

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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research