Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066909
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066909 (product of primes < n that do not divide n) (mod n). +0
1
0, 1, 2, 3, 1, 5, 2, 1, 7, 1, 1, 1, 9, 3, 7, 7, 8, 17, 18, 9, 16, 15, 15, 1, 24, 1, 26, 13, 17, 1, 19, 9, 14, 23, 3, 23, 11, 31, 19, 1, 6, 37, 26, 21, 7, 45, 35, 35, 25, 41, 2, 17, 27, 1, 31, 43, 50, 41, 15, 49, 55, 9, 10, 51, 28, 37, 30, 13, 26, 47, 24, 13, 28, 27, 73, 73, 76, 43, 4 (list; graph; listen)
OFFSET

1,3

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

a(8) = (3 * 5 * 7) (mod 8) = 1 because 3, 5 and 7 are the primes < 8 that do not divide 8.

CROSSREFS

Sequence in context: A080305 A053815 A166333 this_sequence A095195 A076791 A075014

Adjacent sequences: A066906 A066907 A066908 this_sequence A066910 A066911 A066912

KEYWORD

nonn

AUTHOR

Leroy Quet Jan 22 2002

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research