Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119688
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119688 n!! mod (n+1). +0
1
1, 2, 3, 3, 3, 6, 1, 6, 5, 1, 3, 8, 7, 0, 1, 13, 9, 1, 15, 0, 11, 1, 9, 0, 13, 0, 7, 17, 15, 1, 1, 0, 17, 0, 27, 6, 19, 0, 25, 9, 21, 1, 11, 0, 23, 46, 33, 0, 25, 0, 39, 30, 27, 0, 49, 0, 29, 58, 15, 50, 31, 0, 10, 33, 1, 51, 0, 35, 1, 9, 27, 37, 0, 19, 0, 39, 78, 65, 0, 41, 82, 63, 0, 43, 0, 33 (list; graph; listen)
OFFSET

1,2

EXAMPLE

n=5 5!! = 5*3*1 = 15 mod (5+1) = 15 mod 6 = 3

n=6 6!! = 6*4*2 = 48 mod (6+1) = 48 mod 7 = 6

MAPLE

P:= proc(n) local i, j, k, s; for k from 1 by 1 to n do i:=k; j:=k-2; while j >0 do i:=i*j; j:=j-2; od: s:=i mod (k+1); print(s); od: end: P(100);

CROSSREFS

Cf. A061006.

Adjacent sequences: A119685 A119686 A119687 this_sequence A119689 A119690 A119691

Sequence in context: A042957 A131048 A126868 this_sequence A134187 A078644 A133700

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Jun 09 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 October 13 17:46 EDT 2008. Contains 145008 sequences.


AT&T Labs Research